Theorem f1finf1o 6710

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

Step	Hyp	Ref	Expression
1		simpr 109	. . . 4 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> F : A -1-1-> B )
2		simplr 498	. . . . 5 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> B e. Fin )
3		f1rn 5230	. . . . . 6 |- ( F : A -1-1-> B -> ran F C_ B )
4	3	adantl 272	. . . . 5 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ran F C_ B )
5		f1fn 5231	. . . . . . . . 9 |- ( F : A -1-1-> B -> F Fn A )
6		fnima 5145	. . . . . . . . 9 |- ( F Fn A -> ( F " A ) = ran F )
7	5, 6	syl 14	. . . . . . . 8 |- ( F : A -1-1-> B -> ( F " A ) = ran F )
8	7	adantl 272	. . . . . . 7 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ( F " A ) = ran F )
9		ssid 3045	. . . . . . . . 9 |- A C_ A
10	9	a1i 9	. . . . . . . 8 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> A C_ A )
11		simpll 497	. . . . . . . . 9 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> A ~~ B )
12		enfii 6644	. . . . . . . . 9 |- ( ( B e. Fin /\ A ~~ B ) -> A e. Fin )
13	2, 11, 12	syl2anc 404	. . . . . . . 8 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> A e. Fin )
14		f1imaeng 6563	. . . . . . . 8 |- ( ( F : A -1-1-> B /\ A C_ A /\ A e. Fin ) -> ( F " A ) ~~ A )
15	1, 10, 13, 14	syl3anc 1175	. . . . . . 7 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ( F " A ) ~~ A )
16	8, 15	eqbrtrrd 3873	. . . . . 6 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ran F ~~ A )
17		entr 6555	. . . . . 6 |- ( ( ran F ~~ A /\ A ~~ B ) -> ran F ~~ B )
18	16, 11, 17	syl2anc 404	. . . . 5 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ran F ~~ B )
19		fisseneq 6696	. . . . 5 |- ( ( B e. Fin /\ ran F C_ B /\ ran F ~~ B ) -> ran F = B )
20	2, 4, 18, 19	syl3anc 1175	. . . 4 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> ran F = B )
21		dff1o5 5275	. . . 4 |- ( F : A -1-1-onto-> B <-> ( F : A -1-1-> B /\ ran F = B ) )
22	1, 20, 21	sylanbrc 409	. . 3 |- ( ( ( A ~~ B /\ B e. Fin ) /\ F : A -1-1-> B ) -> F : A -1-1-onto-> B )
23	22	ex 114	. 2 |- ( ( A ~~ B /\ B e. Fin ) -> ( F : A -1-1-> B -> F : A -1-1-onto-> B ) )
24		f1of1 5265	. 2 |- ( F : A -1-1-onto-> B -> F : A -1-1-> B )
25	23, 24	impbid1 141	1 |- ( ( A ~~ B /\ B e. Fin ) -> ( F : A -1-1-> B <-> F : A -1-1-onto-> B ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1290   e. wcel 1439   C_ wss 3000   class class class wbr 3851   ran crn 4452   "cima 4454   Fn wfn 5023   -1-1->wf1 5025   -1-1-onto->wf1o 5027   ~~ cen 6509   Fincfn 6511

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-nul 3971  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-iinf 4416

This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-if 3398  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-int 3695  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-tr 3943  df-id 4129  df-iord 4202  df-on 4204  df-suc 4207  df-iom 4419  df-xp 4457  df-rel 4458  df-cnv 4459  df-co 4460  df-dm 4461  df-rn 4462  df-res 4463  df-ima 4464  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-1o 6195  df-er 6306  df-en 6512  df-fin 6514

This theorem is referenced by:  iseqf1olemqf1o  9976  crth  11532