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

Theorem f1finf1o 7006
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 528 . . . . 5  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  B  e.  Fin )
3 f1rn 5460 . . . . . 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 5461 . . . . . . . . 9  |-  ( F : A -1-1-> B  ->  F  Fn  A )
6 fnima 5372 . . . . . . . . 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 3199 . . . . . . . . 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 6930 . . . . . . . . 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 6846 . . . . . . . 8  |-  ( ( F : A -1-1-> B  /\  A  C_  A  /\  A  e.  Fin )  ->  ( F " A
)  ~~  A )
151, 10, 13, 14syl3anc 1249 . . . . . . 7  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ( F " A )  ~~  A
)
168, 15eqbrtrrd 4053 . . . . . 6  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  ~~  A )
17 entr 6838 . . . . . 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 6988 . . . . 5  |-  ( ( B  e.  Fin  /\  ran  F  C_  B  /\  ran  F  ~~  B )  ->  ran  F  =  B )
202, 4, 18, 19syl3anc 1249 . . . 4  |-  ( ( ( A  ~~  B  /\  B  e.  Fin )  /\  F : A -1-1-> B )  ->  ran  F  =  B )
21 dff1o5 5509 . . . 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 5499 . 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 1364    e. wcel 2164    C_ wss 3153   class class class wbr 4029   ran crn 4660   "cima 4662    Fn wfn 5249   -1-1->wf1 5251   -1-1-onto->wf1o 5253    ~~ cen 6792   Fincfn 6794
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-1o 6469  df-er 6587  df-en 6795  df-fin 6797
This theorem is referenced by:  iseqf1olemqf1o  10577  crth  12362  eulerthlemh  12369  lgseisenlem2  15187  pwf1oexmid  15490
  Copyright terms: Public domain W3C validator