Theorem fihashf1rn 11205

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.

Step	Hyp	Ref	Expression
1		f1fn 5595	. . 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 7240	. . 3 |- ( ( F Fn A /\ A e. Fin ) -> F e. Fin )
4	1, 2, 3	syl2an2 602	. 2 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> F e. Fin )
5		f1o2ndf1 6454	. . . 4 |- ( F : A -1-1-> B -> ( 2nd |` F ) : F -1-1-onto-> ran F )
6		df-2nd 6365	. . . . . . . . 9 |- 2nd = ( x e. _V |-> U. ran { x } )
7	6	funmpt2 5411	. . . . . . . 8 |- Fun 2nd
8		f1f 5593	. . . . . . . . . . 11 |- ( F : A -1-1-> B -> F : A --> B )
9	8	anim2i 342	. . . . . . . . . 10 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> ( A e. Fin /\ F : A --> B ) )
10	9	ancomd 267	. . . . . . . . 9 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> ( F : A --> B /\ A e. Fin ) )
11		fex 5937	. . . . . . . . 9 |- ( ( F : A --> B /\ A e. Fin ) -> F e. _V )
12	10, 11	syl 14	. . . . . . . 8 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> F e. _V )
13		resfunexg 5927	. . . . . . . 8 |- ( ( Fun 2nd /\ F e. _V ) -> ( 2nd |` F ) e. _V )
14	7, 12, 13	sylancr 418	. . . . . . 7 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> ( 2nd |` F ) e. _V )
15		f1oeq1 5622	. . . . . . . . . 10 |- ( ( 2nd |` F ) = f -> ( ( 2nd |` F ) : F -1-1-onto-> ran F <-> f : F -1-1-onto-> ran F ) )
16	15	biimpd 144	. . . . . . . . 9 |- ( ( 2nd |` F ) = f -> ( ( 2nd |` F ) : F -1-1-onto-> ran F -> f : F -1-1-onto-> ran F ) )
17	16	eqcoms 2241	. . . . . . . 8 |- ( f = ( 2nd |` F ) -> ( ( 2nd |` F ) : F -1-1-onto-> ran F -> f : F -1-1-onto-> ran F ) )
18	17	adantl 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 ) )
19	14, 18	spcimedv 2911	. . . . . 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 ) )
20	19	ex 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 ) ) )
21	20	com13 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 ) ) )
22	5, 21	mpcom 36	. . 3 |- ( F : A -1-1-> B -> ( A e. Fin -> E. f f : F -1-1-onto-> ran F ) )
23	22	impcom 125	. 2 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> E. f f : F -1-1-onto-> ran F )
24		fihasheqf1oi 11204	. . . 4 |- ( ( F e. Fin /\ f : F -1-1-onto-> ran F ) -> (♯ ` F ) = (♯ ` ran F ) )
25	24	ex 115	. . 3 |- ( F e. Fin -> ( f : F -1-1-onto-> ran F -> (♯ ` F ) = (♯ ` ran F ) ) )
26	25	exlimdv 1872	. 2 |- ( F e. Fin -> ( E. f f : F -1-1-onto-> ran F -> (♯ ` F ) = (♯ ` ran F ) ) )
27	4, 23, 26	sylc 62	1 |- ( ( A e. Fin /\ F : A -1-1-> B ) -> (♯ ` F ) = (♯ ` ran F ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1402   E.wex 1545   e. wcel 2209   _Vcvv 2821   {csn 3705   U.cuni 3930   ran crn 4770   |` cres 4771   Fun wfun 5366   Fn wfn 5367   -->wf 5368   -1-1->wf1 5369   -1-1-onto->wf1o 5371   ` cfv 5372   2ndc2nd 6363   Fincfn 7012  ♯chash 11192

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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285

This theorem 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-nel 2516  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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-en 7013  df-dom 7014  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-ihash 11193

This theorem is referenced by: (None)