Theorem php5 7159

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 4547	. . . 4 ⊢ (𝑤 = ∅ → suc 𝑤 = suc ∅)
3	1, 2	breq12d 4143	. . 3 ⊢ (𝑤 = ∅ → (𝑤 ≈ suc 𝑤 ↔ ∅ ≈ suc ∅))
4	3	notbid 677	. 2 ⊢ (𝑤 = ∅ → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ ∅ ≈ suc ∅))
5		id 19	. . . 4 ⊢ (𝑤 = 𝑘 → 𝑤 = 𝑘)
6		suceq 4547	. . . 4 ⊢ (𝑤 = 𝑘 → suc 𝑤 = suc 𝑘)
7	5, 6	breq12d 4143	. . 3 ⊢ (𝑤 = 𝑘 → (𝑤 ≈ suc 𝑤 ↔ 𝑘 ≈ suc 𝑘))
8	7	notbid 677	. 2 ⊢ (𝑤 = 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝑘 ≈ suc 𝑘))
9		id 19	. . . 4 ⊢ (𝑤 = suc 𝑘 → 𝑤 = suc 𝑘)
10		suceq 4547	. . . 4 ⊢ (𝑤 = suc 𝑘 → suc 𝑤 = suc suc 𝑘)
11	9, 10	breq12d 4143	. . 3 ⊢ (𝑤 = suc 𝑘 → (𝑤 ≈ suc 𝑤 ↔ suc 𝑘 ≈ suc suc 𝑘))
12	11	notbid 677	. 2 ⊢ (𝑤 = suc 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ suc 𝑘 ≈ suc suc 𝑘))
13		id 19	. . . 4 ⊢ (𝑤 = 𝐴 → 𝑤 = 𝐴)
14		suceq 4547	. . . 4 ⊢ (𝑤 = 𝐴 → suc 𝑤 = suc 𝐴)
15	13, 14	breq12d 4143	. . 3 ⊢ (𝑤 = 𝐴 → (𝑤 ≈ suc 𝑤 ↔ 𝐴 ≈ suc 𝐴))
16	15	notbid 677	. 2 ⊢ (𝑤 = 𝐴 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝐴 ≈ suc 𝐴))
17		peano1 4741	. . . . 5 ⊢ ∅ ∈ ω
18		peano3 4743	. . . . 5 ⊢ (∅ ∈ ω → suc ∅ ≠ ∅)
19	17, 18	ax-mp 5	. . . 4 ⊢ suc ∅ ≠ ∅
20		en0 7082	. . . 4 ⊢ (suc ∅ ≈ ∅ ↔ suc ∅ = ∅)
21	19, 20	nemtbir 2509	. . 3 ⊢ ¬ suc ∅ ≈ ∅
22		ensymb 7067	. . 3 ⊢ (suc ∅ ≈ ∅ ↔ ∅ ≈ suc ∅)
23	21, 22	mtbi 681	. 2 ⊢ ¬ ∅ ≈ suc ∅
24		peano2 4742	. . . 4 ⊢ (𝑘 ∈ ω → suc 𝑘 ∈ ω)
25		vex 2824	. . . . 5 ⊢ 𝑘 ∈ V
26	25	sucex 4646	. . . . 5 ⊢ suc 𝑘 ∈ V
27	25, 26	phplem4 7156	. . . 4 ⊢ ((𝑘 ∈ ω ∧ suc 𝑘 ∈ ω) → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘))
28	24, 27	mpdan 425	. . 3 ⊢ (𝑘 ∈ ω → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘))
29	28	con3d 640	. 2 ⊢ (𝑘 ∈ ω → (¬ 𝑘 ≈ suc 𝑘 → ¬ suc 𝑘 ≈ suc suc 𝑘))
30	4, 8, 12, 16, 23, 29	finds 4747	1 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ≈ suc 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ∅c0 3520   class class class wbr 4130  suc csuc 4510  ωcom 4737   ≈ cen 7020

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-er 6807  df-en 7023

This theorem is used by:  snnen2og  7160  1nen2  7162  php5dom  7164  php5fin  7186