Theorem php5 7043

Description: A natural number is not equinumerous to its successor. Corollary 10.21(1) of [TakeutiZaring] p. 90. (Contributed by NM, 26-Jul-2004.)

Assertion

Ref	Expression
php5	⊢ (𝐴 ∈ ω → ¬ 𝐴 ≈ suc 𝐴)

Proof of Theorem php5

Dummy variables 𝑤 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. . . 4 ⊢ (𝑤 = ∅ → 𝑤 = ∅)
2		suceq 4499	. . . 4 ⊢ (𝑤 = ∅ → suc 𝑤 = suc ∅)
3	1, 2	breq12d 4101	. . 3 ⊢ (𝑤 = ∅ → (𝑤 ≈ suc 𝑤 ↔ ∅ ≈ suc ∅))
4	3	notbid 673	. 2 ⊢ (𝑤 = ∅ → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ ∅ ≈ suc ∅))
5		id 19	. . . 4 ⊢ (𝑤 = 𝑘 → 𝑤 = 𝑘)
6		suceq 4499	. . . 4 ⊢ (𝑤 = 𝑘 → suc 𝑤 = suc 𝑘)
7	5, 6	breq12d 4101	. . 3 ⊢ (𝑤 = 𝑘 → (𝑤 ≈ suc 𝑤 ↔ 𝑘 ≈ suc 𝑘))
8	7	notbid 673	. 2 ⊢ (𝑤 = 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝑘 ≈ suc 𝑘))
9		id 19	. . . 4 ⊢ (𝑤 = suc 𝑘 → 𝑤 = suc 𝑘)
10		suceq 4499	. . . 4 ⊢ (𝑤 = suc 𝑘 → suc 𝑤 = suc suc 𝑘)
11	9, 10	breq12d 4101	. . 3 ⊢ (𝑤 = suc 𝑘 → (𝑤 ≈ suc 𝑤 ↔ suc 𝑘 ≈ suc suc 𝑘))
12	11	notbid 673	. 2 ⊢ (𝑤 = suc 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ suc 𝑘 ≈ suc suc 𝑘))
13		id 19	. . . 4 ⊢ (𝑤 = 𝐴 → 𝑤 = 𝐴)
14		suceq 4499	. . . 4 ⊢ (𝑤 = 𝐴 → suc 𝑤 = suc 𝐴)
15	13, 14	breq12d 4101	. . 3 ⊢ (𝑤 = 𝐴 → (𝑤 ≈ suc 𝑤 ↔ 𝐴 ≈ suc 𝐴))
16	15	notbid 673	. 2 ⊢ (𝑤 = 𝐴 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝐴 ≈ suc 𝐴))
17		peano1 4692	. . . . 5 ⊢ ∅ ∈ ω
18		peano3 4694	. . . . 5 ⊢ (∅ ∈ ω → suc ∅ ≠ ∅)
19	17, 18	ax-mp 5	. . . 4 ⊢ suc ∅ ≠ ∅
20		en0 6968	. . . 4 ⊢ (suc ∅ ≈ ∅ ↔ suc ∅ = ∅)
21	19, 20	nemtbir 2491	. . 3 ⊢ ¬ suc ∅ ≈ ∅
22		ensymb 6953	. . 3 ⊢ (suc ∅ ≈ ∅ ↔ ∅ ≈ suc ∅)
23	21, 22	mtbi 676	. 2 ⊢ ¬ ∅ ≈ suc ∅
24		peano2 4693	. . . 4 ⊢ (𝑘 ∈ ω → suc 𝑘 ∈ ω)
25		vex 2805	. . . . 5 ⊢ 𝑘 ∈ V
26	25	sucex 4597	. . . . 5 ⊢ suc 𝑘 ∈ V
27	25, 26	phplem4 7040	. . . 4 ⊢ ((𝑘 ∈ ω ∧ suc 𝑘 ∈ ω) → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘))
28	24, 27	mpdan 421	. . 3 ⊢ (𝑘 ∈ ω → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘))
29	28	con3d 636	. 2 ⊢ (𝑘 ∈ ω → (¬ 𝑘 ≈ suc 𝑘 → ¬ suc 𝑘 ≈ suc suc 𝑘))
30	4, 8, 12, 16, 23, 29	finds 4698	1 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ≈ suc 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1397   ∈ wcel 2202   ≠ wne 2402  ∅c0 3494   class class class wbr 4088  suc csuc 4462  ωcom 4688   ≈ cen 6906

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-er 6701  df-en 6909

This theorem is referenced by:  snnen2og  7044  1nen2  7046  php5dom  7048  php5fin  7070