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

Theorem fihashf1rn 11176
Description: The size of a finite set which is a one-to-one function is equal to the size of the function's range. (Contributed by Jim Kingdon, 21-Feb-2022.)
Assertion
Ref Expression
fihashf1rn  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( `  F )  =  ( `  ran  F ) )

Proof of Theorem fihashf1rn
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 f1fn 5580 . . 3  |-  ( F : A -1-1-> B  ->  F  Fn  A )
2 simpl 109 . . 3  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  A  e.  Fin )
3 fnfi 7216 . . 3  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  F  e.  Fin )
41, 2, 3syl2an2 598 . 2  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  F  e.  Fin )
5 f1o2ndf1 6437 . . . 4  |-  ( F : A -1-1-> B  -> 
( 2nd  |`  F ) : F -1-1-onto-> ran  F )
6 df-2nd 6348 . . . . . . . . 9  |-  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )
76funmpt2 5396 . . . . . . . 8  |-  Fun  2nd
8 f1f 5578 . . . . . . . . . . 11  |-  ( F : A -1-1-> B  ->  F : A --> B )
98anim2i 342 . . . . . . . . . 10  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( A  e. 
Fin  /\  F : A
--> B ) )
109ancomd 267 . . . . . . . . 9  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( F : A
--> B  /\  A  e. 
Fin ) )
11 fex 5920 . . . . . . . . 9  |-  ( ( F : A --> B  /\  A  e.  Fin )  ->  F  e.  _V )
1210, 11syl 14 . . . . . . . 8  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  F  e.  _V )
13 resfunexg 5910 . . . . . . . 8  |-  ( ( Fun  2nd  /\  F  e. 
_V )  ->  ( 2nd  |`  F )  e. 
_V )
147, 12, 13sylancr 414 . . . . . . 7  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( 2nd  |`  F )  e.  _V )
15 f1oeq1 5607 . . . . . . . . . 10  |-  ( ( 2nd  |`  F )  =  f  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  <->  f : F
-1-1-onto-> ran  F ) )
1615biimpd 144 . . . . . . . . 9  |-  ( ( 2nd  |`  F )  =  f  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  f : F -1-1-onto-> ran  F ) )
1716eqcoms 2237 . . . . . . . 8  |-  ( f  =  ( 2nd  |`  F )  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  f : F -1-1-onto-> ran  F ) )
1817adantl 277 . . . . . . 7  |-  ( ( ( A  e.  Fin  /\  F : A -1-1-> B
)  /\  f  =  ( 2nd  |`  F )
)  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  f : F -1-1-onto-> ran  F ) )
1914, 18spcimedv 2905 . . . . . 6  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  E. f  f : F -1-1-onto-> ran  F ) )
2019ex 115 . . . . 5  |-  ( A  e.  Fin  ->  ( F : A -1-1-> B  -> 
( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  E. f 
f : F -1-1-onto-> ran  F
) ) )
2120com13 80 . . . 4  |-  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  ( F : A -1-1-> B  -> 
( A  e.  Fin  ->  E. f  f : F -1-1-onto-> ran  F ) ) )
225, 21mpcom 36 . . 3  |-  ( F : A -1-1-> B  -> 
( A  e.  Fin  ->  E. f  f : F -1-1-onto-> ran  F ) )
2322impcom 125 . 2  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  E. f  f : F -1-1-onto-> ran  F )
24 fihasheqf1oi 11175 . . . 4  |-  ( ( F  e.  Fin  /\  f : F -1-1-onto-> ran  F )  -> 
( `  F )  =  ( `  ran  F ) )
2524ex 115 . . 3  |-  ( F  e.  Fin  ->  (
f : F -1-1-onto-> ran  F  ->  ( `  F )  =  ( `  ran  F ) ) )
2625exlimdv 1868 . 2  |-  ( F  e.  Fin  ->  ( E. f  f : F
-1-1-onto-> ran  F  ->  ( `  F
)  =  ( `  ran  F ) ) )
274, 23, 26sylc 62 1  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( `  F )  =  ( `  ran  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2205   _Vcvv 2815   {csn 3694   U.cuni 3919   ran crn 4755    |` cres 4756   Fun wfun 5351    Fn wfn 5352   -->wf 5353   -1-1->wf1 5354   -1-1-onto->wf1o 5356   ` cfv 5357   2ndc2nd 6346   Fincfn 6988  ♯chash 11163
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-ihash 11164
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator