Theorem f1finf1o 9046

Description: Any injection from one finite set to another of equal size must be a bijection. (Contributed by Jeff Madsen, 5-Jun-2010.) (Revised by Mario Carneiro, 27-Feb-2014.)

Assertion

Ref	Expression
f1finf1o	⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (𝐹:𝐴–1-1→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))

Proof of Theorem f1finf1o

Step	Hyp	Ref	Expression
1		simpr 485	. . . 4 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹:𝐴–1-1→𝐵)
2		f1f 6670	. . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
3	2	adantl 482	. . . . . 6 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹:𝐴⟶𝐵)
4	3	ffnd 6601	. . . . 5 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹 Fn 𝐴)
5		simpll 764	. . . . . 6 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≈ 𝐵)
6	3	frnd 6608	. . . . . . . . 9 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → ran 𝐹 ⊆ 𝐵)
7		df-pss 3906	. . . . . . . . . 10 ⊢ (ran 𝐹 ⊊ 𝐵 ↔ (ran 𝐹 ⊆ 𝐵 ∧ ran 𝐹 ≠ 𝐵))
8	7	baib 536	. . . . . . . . 9 ⊢ (ran 𝐹 ⊆ 𝐵 → (ran 𝐹 ⊊ 𝐵 ↔ ran 𝐹 ≠ 𝐵))
9	6, 8	syl 17	. . . . . . . 8 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (ran 𝐹 ⊊ 𝐵 ↔ ran 𝐹 ≠ 𝐵))
10		simplr 766	. . . . . . . . . . . . 13 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐵 ∈ Fin)
11		relen 8738	. . . . . . . . . . . . . . 15 ⊢ Rel ≈
12	11	brrelex1i 5643	. . . . . . . . . . . . . 14 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V)
13	5, 12	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ∈ V)
14	10, 13	elmapd 8629	. . . . . . . . . . . 12 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹 ∈ (𝐵 ↑m 𝐴) ↔ 𝐹:𝐴⟶𝐵))
15	3, 14	mpbird 256	. . . . . . . . . . 11 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹 ∈ (𝐵 ↑m 𝐴))
16		f1f1orn 6727	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
17	16	adantl 482	. . . . . . . . . . 11 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹:𝐴–1-1-onto→ran 𝐹)
18		f1oen3g 8754	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (𝐵 ↑m 𝐴) ∧ 𝐹:𝐴–1-1-onto→ran 𝐹) → 𝐴 ≈ ran 𝐹)
19	15, 17, 18	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≈ ran 𝐹)
20		php3 8995	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Fin ∧ ran 𝐹 ⊊ 𝐵) → ran 𝐹 ≺ 𝐵)
21	20	ex 413	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Fin → (ran 𝐹 ⊊ 𝐵 → ran 𝐹 ≺ 𝐵))
22	10, 21	syl 17	. . . . . . . . . 10 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (ran 𝐹 ⊊ 𝐵 → ran 𝐹 ≺ 𝐵))
23		ensdomtr 8900	. . . . . . . . . 10 ⊢ ((𝐴 ≈ ran 𝐹 ∧ ran 𝐹 ≺ 𝐵) → 𝐴 ≺ 𝐵)
24	19, 22, 23	syl6an 681	. . . . . . . . 9 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (ran 𝐹 ⊊ 𝐵 → 𝐴 ≺ 𝐵))
25		sdomnen 8769	. . . . . . . . 9 ⊢ (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵)
26	24, 25	syl6 35	. . . . . . . 8 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (ran 𝐹 ⊊ 𝐵 → ¬ 𝐴 ≈ 𝐵))
27	9, 26	sylbird 259	. . . . . . 7 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (ran 𝐹 ≠ 𝐵 → ¬ 𝐴 ≈ 𝐵))
28	27	necon4ad 2962	. . . . . 6 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → (𝐴 ≈ 𝐵 → ran 𝐹 = 𝐵))
29	5, 28	mpd 15	. . . . 5 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → ran 𝐹 = 𝐵)
30		df-fo 6439	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵))
31	4, 29, 30	sylanbrc 583	. . . 4 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹:𝐴–onto→𝐵)
32		df-f1o 6440	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵))
33	1, 31, 32	sylanbrc 583	. . 3 ⊢ (((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐹:𝐴–1-1-onto→𝐵)
34	33	ex 413	. 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→𝐵))
35		f1of1 6715	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–1-1→𝐵)
36	34, 35	impbid1 224	1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (𝐹:𝐴–1-1→𝐵 ↔ 𝐹:𝐴–1-1-onto→𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  Vcvv 3432   ⊆ wss 3887   ⊊ wpss 3888   class class class wbr 5074  ran crn 5590   Fn wfn 6428  ⟶wf 6429  –1-1→wf1 6430  –onto→wfo 6431  –1-1-onto→wf1o 6432  (class class class)co 7275   ↑_m cmap 8615   ≈ cen 8730   ≺ csdm 8732  Fincfn 8733

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1o 8297  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737

This theorem is referenced by:  hashfac  14172  crth  16479  eulerthlem2  16483  fidomndrnglem  20578  mdetunilem8  21768  basellem4  26233  lgsqrlem4  26497  lgseisenlem2  26524