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

Theorem fihashf1rn 10528
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 5325 . . 3  |-  ( F : A -1-1-> B  ->  F  Fn  A )
2 simpl 108 . . 3  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  A  e.  Fin )
3 fnfi 6818 . . 3  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  F  e.  Fin )
41, 2, 3syl2an2 583 . 2  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  F  e.  Fin )
5 f1o2ndf1 6118 . . . 4  |-  ( F : A -1-1-> B  -> 
( 2nd  |`  F ) : F -1-1-onto-> ran  F )
6 df-2nd 6032 . . . . . . . . 9  |-  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )
76funmpt2 5157 . . . . . . . 8  |-  Fun  2nd
8 f1f 5323 . . . . . . . . . . 11  |-  ( F : A -1-1-> B  ->  F : A --> B )
98anim2i 339 . . . . . . . . . 10  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( A  e. 
Fin  /\  F : A
--> B ) )
109ancomd 265 . . . . . . . . 9  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( F : A
--> B  /\  A  e. 
Fin ) )
11 fex 5640 . . . . . . . . 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 5634 . . . . . . . 8  |-  ( ( Fun  2nd  /\  F  e. 
_V )  ->  ( 2nd  |`  F )  e. 
_V )
147, 12, 13sylancr 410 . . . . . . 7  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  ( 2nd  |`  F )  e.  _V )
15 f1oeq1 5351 . . . . . . . . . 10  |-  ( ( 2nd  |`  F )  =  f  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  <->  f : F
-1-1-onto-> ran  F ) )
1615biimpd 143 . . . . . . . . 9  |-  ( ( 2nd  |`  F )  =  f  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  f : F -1-1-onto-> ran  F ) )
1716eqcoms 2140 . . . . . . . 8  |-  ( f  =  ( 2nd  |`  F )  ->  ( ( 2nd  |`  F ) : F -1-1-onto-> ran  F  ->  f : F -1-1-onto-> ran  F ) )
1817adantl 275 . . . . . . 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 2767 . . . . . 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 114 . . . . 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 124 . 2  |-  ( ( A  e.  Fin  /\  F : A -1-1-> B )  ->  E. f  f : F -1-1-onto-> ran  F )
24 fihasheqf1oi 10527 . . . 4  |-  ( ( F  e.  Fin  /\  f : F -1-1-onto-> ran  F )  -> 
( `  F )  =  ( `  ran  F ) )
2524ex 114 . . 3  |-  ( F  e.  Fin  ->  (
f : F -1-1-onto-> ran  F  ->  ( `  F )  =  ( `  ran  F ) ) )
2625exlimdv 1791 . 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 103    = wceq 1331   E.wex 1468    e. wcel 1480   _Vcvv 2681   {csn 3522   U.cuni 3731   ran crn 4535    |` cres 4536   Fun wfun 5112    Fn wfn 5113   -->wf 5114   -1-1->wf1 5115   -1-1-onto->wf1o 5117   ` cfv 5118   2ndc2nd 6030   Fincfn 6627  ♯chash 10514
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-ltadd 7729
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-if 3470  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-ilim 4286  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-2nd 6032  df-recs 6195  df-frec 6281  df-1o 6306  df-er 6422  df-en 6628  df-dom 6629  df-fin 6630  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-inn 8714  df-n0 8971  df-z 9048  df-uz 9320  df-ihash 10515
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator