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

Theorem f1finf1o 7217
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 529 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  B  e.  Fin )
3 f1rn 5574 . . . . . 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 5575 . . . . . . . . 9  |-  ( F : A -1-1-> B  ->  F  Fn  A )
6 fnima 5477 . . . . . . . . 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 3258 . . . . . . . . 9  |-  A  C_  A
109a1i 9 . . . . . . . 8  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  C_  A
)
11 simpll 527 . . . . . . . . 9  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  ~~  B )
12 enfii 7129 . . . . . . . . 9  |-  ( ( B  e.  Fin  /\  A  ~~  B )  ->  A  e.  Fin )
132, 11, 12syl2anc 411 . . . . . . . 8  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  A  e.  Fin )
14 f1imaeng 7032 . . . . . . . 8  |-  ( ( F : A -1-1-> B  /\  A  C_  A  /\  A  e.  Fin )  ->  ( F " A
)  ~~  A )
151, 10, 13, 14syl3anc 1274 . . . . . . 7  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ( F " A )  ~~  A
)
168, 15eqbrtrrd 4133 . . . . . 6  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  ~~  A )
17 entr 7024 . . . . . 6  |-  ( ( ran  F  ~~  A  /\  A  ~~  B )  ->  ran  F  ~~  B )
1816, 11, 17syl2anc 411 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  ~~  B )
19 fisseneq 7195 . . . . 5  |-  ( ( B  e.  Fin  /\  ran  F  C_  B  /\  ran  F  ~~  B )  ->  ran  F  =  B )
202, 4, 18, 19syl3anc 1274 . . . 4  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  =  B )
21 dff1o5 5623 . . . 4  |-  ( F : A -1-1-onto-> B  <->  ( F : A -1-1-> B  /\  ran  F  =  B ) )
221, 20, 21sylanbrc 417 . . 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 5613 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203    C_ wss 3211   class class class wbr 4109   ran crn 4750   "cima 4752    Fn wfn 5347   -1-1->wf1 5349   -1-1-onto->wf1o 5351    ~~ cen 6973   Fincfn 6975
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1o 6647  df-er 6767  df-en 6976  df-fin 6978
This theorem is referenced by:  iseqf1olemqf1o  10868  crth  12921  eulerthlemh  12928  lgseisenlem2  15944  pwf1oexmid  16773
  Copyright terms: Public domain W3C validator