Theorem f1dmvrnfibi 7134

Description: A one-to-one function whose domain is a set is finite if and only if its range is finite. See also f1vrnfibi 7135. (Contributed by AV, 10-Jan-2020.)

Assertion

Ref	Expression
f1dmvrnfibi	|- ( ( A e. V /\ F : A -1-1-> B ) -> ( F e. Fin <-> ran F e. Fin ) )

Proof of Theorem f1dmvrnfibi

Step	Hyp	Ref	Expression
1		f1rel 5543	. . . 4 |- ( F : A -1-1-> B -> Rel F )
2	1	ad2antlr 489	. . 3 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ F e. Fin ) -> Rel F )
3		f1cnv 5604	. . . . 5 |- ( F : A -1-1-> B -> `' F : ran F -1-1-onto-> A )
4		f1ofun 5582	. . . . 5 |- ( `' F : ran F -1-1-onto-> A -> Fun `' F )
5	3, 4	syl 14	. . . 4 |- ( F : A -1-1-> B -> Fun `' F )
6	5	ad2antlr 489	. . 3 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ F e. Fin ) -> Fun `' F )
7		simpr 110	. . 3 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ F e. Fin ) -> F e. Fin )
8		funrnfi 7132	. . 3 |- ( ( Rel F /\ Fun `' F /\ F e. Fin ) -> ran F e. Fin )
9	2, 6, 7, 8	syl3anc 1271	. 2 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ F e. Fin ) -> ran F e. Fin )
10		simpr 110	. . . 4 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> ran F e. Fin )
11		f1dm 5544	. . . . . . . 8 |- ( F : A -1-1-> B -> dom F = A )
12		f1f1orn 5591	. . . . . . . 8 |- ( F : A -1-1-> B -> F : A -1-1-onto-> ran F )
13		eleq1 2292	. . . . . . . . . . . 12 |- ( A = dom F -> ( A e. V <-> dom F e. V ) )
14		f1oeq2 5569	. . . . . . . . . . . 12 |- ( A = dom F -> ( F : A -1-1-onto-> ran F <-> F : dom F -1-1-onto-> ran F ) )
15	13, 14	anbi12d 473	. . . . . . . . . . 11 |- ( A = dom F -> ( ( A e. V /\ F : A -1-1-onto-> ran F ) <-> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) ) )
16	15	eqcoms 2232	. . . . . . . . . 10 |- ( dom F = A -> ( ( A e. V /\ F : A -1-1-onto-> ran F ) <-> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) ) )
17	16	biimpd 144	. . . . . . . . 9 |- ( dom F = A -> ( ( A e. V /\ F : A -1-1-onto-> ran F ) -> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) ) )
18	17	expcomd 1484	. . . . . . . 8 |- ( dom F = A -> ( F : A -1-1-onto-> ran F -> ( A e. V -> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) ) ) )
19	11, 12, 18	sylc 62	. . . . . . 7 |- ( F : A -1-1-> B -> ( A e. V -> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) ) )
20	19	impcom 125	. . . . . 6 |- ( ( A e. V /\ F : A -1-1-> B ) -> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) )
21	20	adantr 276	. . . . 5 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) )
22		f1oeng 6925	. . . . 5 |- ( ( dom F e. V /\ F : dom F -1-1-onto-> ran F ) -> dom F ~~ ran F )
23	21, 22	syl 14	. . . 4 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> dom F ~~ ran F )
24		enfii 7056	. . . 4 |- ( ( ran F e. Fin /\ dom F ~~ ran F ) -> dom F e. Fin )
25	10, 23, 24	syl2anc 411	. . 3 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> dom F e. Fin )
26		f1fun 5542	. . . . 5 |- ( F : A -1-1-> B -> Fun F )
27	26	ad2antlr 489	. . . 4 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> Fun F )
28		fundmfibi 7128	. . . 4 |- ( Fun F -> ( F e. Fin <-> dom F e. Fin ) )
29	27, 28	syl 14	. . 3 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> ( F e. Fin <-> dom F e. Fin ) )
30	25, 29	mpbird 167	. 2 |- ( ( ( A e. V /\ F : A -1-1-> B ) /\ ran F e. Fin ) -> F e. Fin )
31	9, 30	impbida 598	1 |- ( ( A e. V /\ F : A -1-1-> B ) -> ( F e. Fin <-> ran F e. Fin ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1395   e. wcel 2200   class class class wbr 4086   `'ccnv 4722   dom cdm 4723   ran crn 4724   Rel wrel 4728   Fun wfun 5318   -1-1->wf1 5321   -1-1-onto->wf1o 5323   ~~ cen 6902   Fincfn 6904

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1st 6298  df-2nd 6299  df-1o 6577  df-er 6697  df-en 6905  df-fin 6907

This theorem is referenced by:  f1vrnfibi  7135