ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1finf1o Unicode version

Theorem f1finf1o 7264
Description: Any injection from one finite set to another of equal size must be a bijection. (Contributed by Jeff Madsen, 5-Jun-2010.)
Assertion
Ref Expression
f1finf1o  |-  ( ( A  ~~  B  /\  B  e.  Fin )  ->  ( F : A -1-1-> B  <-> 
F : A -1-1-onto-> B ) )

Proof of Theorem f1finf1o
StepHypRef Expression
1 simpr 110 . . . 4  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  F : A -1-1-> B )
2 simplr 533 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  B  e.  Fin )
3 f1rn 5599 . . . . . 6  |-  ( F : A -1-1-> B  ->  ran  F  C_  B )
43adantl 277 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  C_  B )
5 f1fn 5600 . . . . . . . . 9  |-  ( F : A -1-1-> B  ->  F  Fn  A )
6 fnima 5502 . . . . . . . . 9  |-  ( F  Fn  A  ->  ( F " A )  =  ran  F )
75, 6syl 14 . . . . . . . 8  |-  ( F : A -1-1-> B  -> 
( F " A
)  =  ran  F
)
87adantl 277 . . . . . . 7  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ( F " A )  =  ran  F )
9 ssid 3268 . . . . . . . . 9  |-  A  C_  A
109a1i 9 . . . . . . . 8  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  C_  A
)
11 simpll 531 . . . . . . . . 9  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  ~~  B )
12 enfii 7176 . . . . . . . . 9  |-  ( ( B  e.  Fin  /\  A  ~~  B )  ->  A  e.  Fin )
132, 11, 12syl2anc 415 . . . . . . . 8  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  e.  Fin )
14 f1imaeng 7079 . . . . . . . 8  |-  ( ( F : A -1-1-> B  /\  A  C_  A  /\  A  e.  Fin )  ->  ( F " A
)  ~~  A )
151, 10, 13, 14syl3anc 1278 . . . . . . 7  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ( F " A )  ~~  A
)
168, 15eqbrtrrd 4154 . . . . . 6  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  ~~  A )
17 entr 7071 . . . . . 6  |-  ( ( ran  F  ~~  A  /\  A  ~~  B )  ->  ran  F  ~~  B )
1816, 11, 17syl2anc 415 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  ~~  B )
19 fisseneq 7242 . . . . 5  |-  ( ( B  e.  Fin  /\  ran  F  C_  B  /\  ran  F  ~~  B )  ->  ran  F  =  B )
202, 4, 18, 19syl3anc 1278 . . . 4  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  =  B )
21 dff1o5 5648 . . . 4  |-  ( F : A -1-1-onto-> B  <->  ( F : A -1-1-> B  /\  ran  F  =  B ) )
221, 20, 21sylanbrc 421 . . 3  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  F : A
-1-1-onto-> B )
2322ex 115 . 2  |-  ( ( A  ~~  B  /\  B  e.  Fin )  ->  ( F : A -1-1-> B  ->  F : A -1-1-onto-> B
) )
24 f1of1 5638 . 2  |-  ( F : A -1-1-onto-> B  ->  F : A -1-1-> B )
2523, 24impbid1 142 1  |-  ( ( A  ~~  B  /\  B  e.  Fin )  ->  ( F : A -1-1-> B  <-> 
F : A -1-1-onto-> B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    C_ wss 3220   class class class wbr 4130   ran crn 4775   "cima 4777    Fn wfn 5372   -1-1->wf1 5374   -1-1-onto->wf1o 5376    ~~ cen 7020   Fincfn 7022
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-er 6807  df-en 7023  df-fin 7025
This theorem is used by:  iseqf1olemqf1o  10943  hashfac  11288  crth  13002  eulerthlemh  13009  lgseisenlem2  16190  pwf1oexmid  17029
  Copyright terms: Public domain W3C validator