Theorem phplem2 9141

Description: Lemma for Pigeonhole Principle. Equinumerosity of successors implies equinumerosity of the original natural numbers. (Contributed by NM, 28-May-1998.) (Revised by Mario Carneiro, 24-Jun-2015.) Avoid ax-pow 5312. (Revised by BTernaryTau, 4-Nov-2024.)

Hypothesis

Ref	Expression
phplem2.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
phplem2	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵 → 𝐴 ≈ 𝐵))

Proof of Theorem phplem2

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 8905	. 2 ⊢ (suc 𝐴 ≈ suc 𝐵 ↔ ∃𝑓 𝑓:suc 𝐴–1-1-onto→suc 𝐵)
2		f1of1 6781	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓:suc 𝐴–1-1→suc 𝐵)
3		nnfi 9104	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → 𝐴 ∈ Fin)
4		sssucid 6407	. . . . . . . . . 10 ⊢ 𝐴 ⊆ suc 𝐴
5		f1imaenfi 9131	. . . . . . . . . 10 ⊢ ((𝑓:suc 𝐴–1-1→suc 𝐵 ∧ 𝐴 ⊆ suc 𝐴 ∧ 𝐴 ∈ Fin) → (𝑓 “ 𝐴) ≈ 𝐴)
6	4, 5	mp3an2 1452	. . . . . . . . 9 ⊢ ((𝑓:suc 𝐴–1-1→suc 𝐵 ∧ 𝐴 ∈ Fin) → (𝑓 “ 𝐴) ≈ 𝐴)
7	2, 3, 6	syl2anr 598	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝑓 “ 𝐴) ≈ 𝐴)
8		ensymfib 9120	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ (𝑓 “ 𝐴) ↔ (𝑓 “ 𝐴) ≈ 𝐴))
9	3, 8	syl 17	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → (𝐴 ≈ (𝑓 “ 𝐴) ↔ (𝑓 “ 𝐴) ≈ 𝐴))
10	9	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝐴 ≈ (𝑓 “ 𝐴) ↔ (𝑓 “ 𝐴) ≈ 𝐴))
11	7, 10	mpbird 257	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ (𝑓 “ 𝐴))
12		nnord 7826	. . . . . . . . . 10 ⊢ (𝐴 ∈ ω → Ord 𝐴)
13		orddif 6423	. . . . . . . . . 10 ⊢ (Ord 𝐴 → 𝐴 = (suc 𝐴 ∖ {𝐴}))
14	12, 13	syl 17	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → 𝐴 = (suc 𝐴 ∖ {𝐴}))
15	14	imaeq2d 6027	. . . . . . . 8 ⊢ (𝐴 ∈ ω → (𝑓 “ 𝐴) = (𝑓 “ (suc 𝐴 ∖ {𝐴})))
16		f1ofn 6783	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓 Fn suc 𝐴)
17		phplem2.1	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ V
18	17	sucid 6409	. . . . . . . . . . 11 ⊢ 𝐴 ∈ suc 𝐴
19		fnsnfv 6921	. . . . . . . . . . 11 ⊢ ((𝑓 Fn suc 𝐴 ∧ 𝐴 ∈ suc 𝐴) → {(𝑓‘𝐴)} = (𝑓 “ {𝐴}))
20	16, 18, 19	sylancl 587	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → {(𝑓‘𝐴)} = (𝑓 “ {𝐴}))
21	20	difeq2d 4080	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ((𝑓 “ suc 𝐴) ∖ {(𝑓‘𝐴)}) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
22		imadmrn 6037	. . . . . . . . . . . 12 ⊢ (𝑓 “ dom 𝑓) = ran 𝑓
23	22	eqcomi 2746	. . . . . . . . . . 11 ⊢ ran 𝑓 = (𝑓 “ dom 𝑓)
24		f1ofo 6789	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓:suc 𝐴–onto→suc 𝐵)
25		forn 6757	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
26	24, 25	syl 17	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
27		f1odm 6786	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → dom 𝑓 = suc 𝐴)
28	27	imaeq2d 6027	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ dom 𝑓) = (𝑓 “ suc 𝐴))
29	23, 26, 28	3eqtr3a 2796	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → suc 𝐵 = (𝑓 “ suc 𝐴))
30	29	difeq1d 4079	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (suc 𝐵 ∖ {(𝑓‘𝐴)}) = ((𝑓 “ suc 𝐴) ∖ {(𝑓‘𝐴)}))
31		dff1o3 6788	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 ↔ (𝑓:suc 𝐴–onto→suc 𝐵 ∧ Fun ◡𝑓))
32		imadif 6584	. . . . . . . . . 10 ⊢ (Fun ◡𝑓 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
33	31, 32	simplbiim 504	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
34	21, 30, 33	3eqtr4rd 2783	. . . . . . . 8 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = (suc 𝐵 ∖ {(𝑓‘𝐴)}))
35	15, 34	sylan9eq 2792	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝑓 “ 𝐴) = (suc 𝐵 ∖ {(𝑓‘𝐴)}))
36	11, 35	breqtrd 5126	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
37		fnfvelrn 7034	. . . . . . . . . . . 12 ⊢ ((𝑓 Fn suc 𝐴 ∧ 𝐴 ∈ suc 𝐴) → (𝑓‘𝐴) ∈ ran 𝑓)
38	16, 18, 37	sylancl 587	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓‘𝐴) ∈ ran 𝑓)
39	25	eleq2d 2823	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–onto→suc 𝐵 → ((𝑓‘𝐴) ∈ ran 𝑓 ↔ (𝑓‘𝐴) ∈ suc 𝐵))
40	24, 39	syl 17	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ((𝑓‘𝐴) ∈ ran 𝑓 ↔ (𝑓‘𝐴) ∈ suc 𝐵))
41	38, 40	mpbid 232	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓‘𝐴) ∈ suc 𝐵)
42		phplem1 9140	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ω ∧ (𝑓‘𝐴) ∈ suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
43	41, 42	sylan2 594	. . . . . . . . 9 ⊢ ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
44		nnfi 9104	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ω → 𝐵 ∈ Fin)
45		ensymfib 9120	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Fin → (𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ↔ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵))
46	44, 45	syl 17	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → (𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ↔ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵))
47	46	adantr 480	. . . . . . . . 9 ⊢ ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ↔ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵))
48	43, 47	mpbid 232	. . . . . . . 8 ⊢ ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵)
49		entrfil 9121	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ∧ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵) → 𝐴 ≈ 𝐵)
50	3, 49	syl3an1 1164	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ∧ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵) → 𝐴 ≈ 𝐵)
51	48, 50	syl3an3 1166	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ∧ (𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵)) → 𝐴 ≈ 𝐵)
52	51	3expa 1119	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)})) ∧ (𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵)) → 𝐴 ≈ 𝐵)
53	36, 52	syldanl 603	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) ∧ (𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵)) → 𝐴 ≈ 𝐵)
54	53	anandirs 680	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ 𝐵)
55	54	ex 412	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝐴 ≈ 𝐵))
56	55	exlimdv 1935	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑓 𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝐴 ≈ 𝐵))
57	1, 56	biimtrid 242	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵 → 𝐴 ≈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  Vcvv 3442   ∖ cdif 3900   ⊆ wss 3903  {csn 4582   class class class wbr 5100  ^◡ccnv 5631  dom cdm 5632  ran crn 5633   “ cima 5635  Ord word 6324  suc csuc 6327  Fun wfun 6494   Fn wfn 6495  –1-1→wf1 6497  –onto→wfo 6498  –1-1-onto→wf1o 6499  ‘cfv 6500  ωcom 7818   ≈ cen 8892  Fincfn 8895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-om 7819  df-1o 8407  df-en 8896  df-fin 8899

This theorem is referenced by:  nneneq  9142