MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fodomfi2 Structured version   Unicode version

Theorem fodomfi2 8489
Description: Onto functions define dominance when a finite number of choices need to be made. (Contributed by Stefan O'Rear, 28-Feb-2015.)
Assertion
Ref Expression
fodomfi2  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  B  ~<_  A )

Proof of Theorem fodomfi2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 fofn 5812 . . . 4  |-  ( F : A -onto-> B  ->  F  Fn  A )
213ad2ant3 1028 . . 3  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  F  Fn  A )
3 forn 5813 . . . . 5  |-  ( F : A -onto-> B  ->  ran  F  =  B )
4 eqimss2 3523 . . . . 5  |-  ( ran 
F  =  B  ->  B  C_  ran  F )
53, 4syl 17 . . . 4  |-  ( F : A -onto-> B  ->  B  C_  ran  F )
653ad2ant3 1028 . . 3  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  B  C_ 
ran  F )
7 simp2 1006 . . 3  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  B  e.  Fin )
8 fipreima 7886 . . 3  |-  ( ( F  Fn  A  /\  B  C_  ran  F  /\  B  e.  Fin )  ->  E. x  e.  ( ~P A  i^i  Fin ) ( F "
x )  =  B )
92, 6, 7, 8syl3anc 1264 . 2  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  E. x  e.  ( ~P A  i^i  Fin ) ( F "
x )  =  B )
10 inss2 3689 . . . . . . . . 9  |-  ( ~P A  i^i  Fin )  C_ 
Fin
1110sseli 3466 . . . . . . . 8  |-  ( x  e.  ( ~P A  i^i  Fin )  ->  x  e.  Fin )
1211adantl 467 . . . . . . 7  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  x  e.  Fin )
13 finnum 8381 . . . . . . 7  |-  ( x  e.  Fin  ->  x  e.  dom  card )
1412, 13syl 17 . . . . . 6  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  x  e.  dom  card )
15 simpl3 1010 . . . . . . . 8  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  F : A -onto-> B )
16 fofun 5811 . . . . . . . 8  |-  ( F : A -onto-> B  ->  Fun  F )
1715, 16syl 17 . . . . . . 7  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  Fun  F )
18 inss1 3688 . . . . . . . . . . 11  |-  ( ~P A  i^i  Fin )  C_ 
~P A
1918sseli 3466 . . . . . . . . . 10  |-  ( x  e.  ( ~P A  i^i  Fin )  ->  x  e.  ~P A )
2019elpwid 3995 . . . . . . . . 9  |-  ( x  e.  ( ~P A  i^i  Fin )  ->  x  C_  A )
2120adantl 467 . . . . . . . 8  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  x  C_  A )
22 fof 5810 . . . . . . . . 9  |-  ( F : A -onto-> B  ->  F : A --> B )
23 fdm 5750 . . . . . . . . 9  |-  ( F : A --> B  ->  dom  F  =  A )
2415, 22, 233syl 18 . . . . . . . 8  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  dom  F  =  A )
2521, 24sseqtr4d 3507 . . . . . . 7  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  x  C_ 
dom  F )
26 fores 5819 . . . . . . 7  |-  ( ( Fun  F  /\  x  C_ 
dom  F )  -> 
( F  |`  x
) : x -onto-> ( F " x ) )
2717, 25, 26syl2anc 665 . . . . . 6  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  ( F  |`  x ) : x -onto-> ( F "
x ) )
28 fodomnum 8486 . . . . . 6  |-  ( x  e.  dom  card  ->  ( ( F  |`  x
) : x -onto-> ( F " x )  ->  ( F "
x )  ~<_  x ) )
2914, 27, 28sylc 62 . . . . 5  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  ( F " x )  ~<_  x )
30 simpl1 1008 . . . . . 6  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  A  e.  V )
31 ssdomg 7622 . . . . . 6  |-  ( A  e.  V  ->  (
x  C_  A  ->  x  ~<_  A ) )
3230, 21, 31sylc 62 . . . . 5  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  x  ~<_  A )
33 domtr 7629 . . . . 5  |-  ( ( ( F " x
)  ~<_  x  /\  x  ~<_  A )  ->  ( F " x )  ~<_  A )
3429, 32, 33syl2anc 665 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  ( F " x )  ~<_  A )
35 breq1 4429 . . . 4  |-  ( ( F " x )  =  B  ->  (
( F " x
)  ~<_  A  <->  B  ~<_  A ) )
3634, 35syl5ibcom 223 . . 3  |-  ( ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B
)  /\  x  e.  ( ~P A  i^i  Fin ) )  ->  (
( F " x
)  =  B  ->  B  ~<_  A ) )
3736rexlimdva 2924 . 2  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  ( E. x  e.  ( ~P A  i^i  Fin )
( F " x
)  =  B  ->  B  ~<_  A ) )
389, 37mpd 15 1  |-  ( ( A  e.  V  /\  B  e.  Fin  /\  F : A -onto-> B )  ->  B  ~<_  A )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 370    /\ w3a 982    = wceq 1437    e. wcel 1870   E.wrex 2783    i^i cin 3441    C_ wss 3442   ~Pcpw 3985   class class class wbr 4426   dom cdm 4854   ran crn 4855    |` cres 4856   "cima 4857   Fun wfun 5595    Fn wfn 5596   -->wf 5597   -onto->wfo 5599    ~<_ cdom 7575   Fincfn 7577   cardccrd 8368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1751  ax-6 1797  ax-7 1841  ax-8 1872  ax-9 1874  ax-10 1889  ax-11 1894  ax-12 1907  ax-13 2055  ax-ext 2407  ax-rep 4538  ax-sep 4548  ax-nul 4556  ax-pow 4603  ax-pr 4661  ax-un 6597
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1790  df-eu 2270  df-mo 2271  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2579  df-ne 2627  df-ral 2787  df-rex 2788  df-reu 2789  df-rmo 2790  df-rab 2791  df-v 3089  df-sbc 3306  df-csb 3402  df-dif 3445  df-un 3447  df-in 3449  df-ss 3456  df-pss 3458  df-nul 3768  df-if 3916  df-pw 3987  df-sn 4003  df-pr 4005  df-tp 4007  df-op 4009  df-uni 4223  df-int 4259  df-iun 4304  df-br 4427  df-opab 4485  df-mpt 4486  df-tr 4521  df-eprel 4765  df-id 4769  df-po 4775  df-so 4776  df-fr 4813  df-se 4814  df-we 4815  df-xp 4860  df-rel 4861  df-cnv 4862  df-co 4863  df-dm 4864  df-rn 4865  df-res 4866  df-ima 4867  df-pred 5399  df-ord 5445  df-on 5446  df-lim 5447  df-suc 5448  df-iota 5565  df-fun 5603  df-fn 5604  df-f 5605  df-f1 5606  df-fo 5607  df-f1o 5608  df-fv 5609  df-isom 5610  df-riota 6267  df-ov 6308  df-oprab 6309  df-mpt2 6310  df-om 6707  df-1st 6807  df-2nd 6808  df-wrecs 7036  df-recs 7098  df-1o 7190  df-er 7371  df-map 7482  df-en 7578  df-dom 7579  df-fin 7581  df-card 8372  df-acn 8375
This theorem is referenced by:  wdomfil  8490
  Copyright terms: Public domain W3C validator