Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > php5 | GIF version |
Description: A natural number is not equinumerous to its successor. Corollary 10.21(1) of [TakeutiZaring] p. 90. (Contributed by NM, 26-Jul-2004.) |
Ref | Expression |
---|---|
php5 | ⊢ (𝐴 ∈ ω → ¬ 𝐴 ≈ suc 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 19 | . . . 4 ⊢ (𝑤 = ∅ → 𝑤 = ∅) | |
2 | suceq 4396 | . . . 4 ⊢ (𝑤 = ∅ → suc 𝑤 = suc ∅) | |
3 | 1, 2 | breq12d 4011 | . . 3 ⊢ (𝑤 = ∅ → (𝑤 ≈ suc 𝑤 ↔ ∅ ≈ suc ∅)) |
4 | 3 | notbid 667 | . 2 ⊢ (𝑤 = ∅ → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ ∅ ≈ suc ∅)) |
5 | id 19 | . . . 4 ⊢ (𝑤 = 𝑘 → 𝑤 = 𝑘) | |
6 | suceq 4396 | . . . 4 ⊢ (𝑤 = 𝑘 → suc 𝑤 = suc 𝑘) | |
7 | 5, 6 | breq12d 4011 | . . 3 ⊢ (𝑤 = 𝑘 → (𝑤 ≈ suc 𝑤 ↔ 𝑘 ≈ suc 𝑘)) |
8 | 7 | notbid 667 | . 2 ⊢ (𝑤 = 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝑘 ≈ suc 𝑘)) |
9 | id 19 | . . . 4 ⊢ (𝑤 = suc 𝑘 → 𝑤 = suc 𝑘) | |
10 | suceq 4396 | . . . 4 ⊢ (𝑤 = suc 𝑘 → suc 𝑤 = suc suc 𝑘) | |
11 | 9, 10 | breq12d 4011 | . . 3 ⊢ (𝑤 = suc 𝑘 → (𝑤 ≈ suc 𝑤 ↔ suc 𝑘 ≈ suc suc 𝑘)) |
12 | 11 | notbid 667 | . 2 ⊢ (𝑤 = suc 𝑘 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ suc 𝑘 ≈ suc suc 𝑘)) |
13 | id 19 | . . . 4 ⊢ (𝑤 = 𝐴 → 𝑤 = 𝐴) | |
14 | suceq 4396 | . . . 4 ⊢ (𝑤 = 𝐴 → suc 𝑤 = suc 𝐴) | |
15 | 13, 14 | breq12d 4011 | . . 3 ⊢ (𝑤 = 𝐴 → (𝑤 ≈ suc 𝑤 ↔ 𝐴 ≈ suc 𝐴)) |
16 | 15 | notbid 667 | . 2 ⊢ (𝑤 = 𝐴 → (¬ 𝑤 ≈ suc 𝑤 ↔ ¬ 𝐴 ≈ suc 𝐴)) |
17 | peano1 4587 | . . . . 5 ⊢ ∅ ∈ ω | |
18 | peano3 4589 | . . . . 5 ⊢ (∅ ∈ ω → suc ∅ ≠ ∅) | |
19 | 17, 18 | ax-mp 5 | . . . 4 ⊢ suc ∅ ≠ ∅ |
20 | en0 6785 | . . . 4 ⊢ (suc ∅ ≈ ∅ ↔ suc ∅ = ∅) | |
21 | 19, 20 | nemtbir 2434 | . . 3 ⊢ ¬ suc ∅ ≈ ∅ |
22 | ensymb 6770 | . . 3 ⊢ (suc ∅ ≈ ∅ ↔ ∅ ≈ suc ∅) | |
23 | 21, 22 | mtbi 670 | . 2 ⊢ ¬ ∅ ≈ suc ∅ |
24 | peano2 4588 | . . . 4 ⊢ (𝑘 ∈ ω → suc 𝑘 ∈ ω) | |
25 | vex 2738 | . . . . 5 ⊢ 𝑘 ∈ V | |
26 | 25 | sucex 4492 | . . . . 5 ⊢ suc 𝑘 ∈ V |
27 | 25, 26 | phplem4 6845 | . . . 4 ⊢ ((𝑘 ∈ ω ∧ suc 𝑘 ∈ ω) → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘)) |
28 | 24, 27 | mpdan 421 | . . 3 ⊢ (𝑘 ∈ ω → (suc 𝑘 ≈ suc suc 𝑘 → 𝑘 ≈ suc 𝑘)) |
29 | 28 | con3d 631 | . 2 ⊢ (𝑘 ∈ ω → (¬ 𝑘 ≈ suc 𝑘 → ¬ suc 𝑘 ≈ suc suc 𝑘)) |
30 | 4, 8, 12, 16, 23, 29 | finds 4593 | 1 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ≈ suc 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1353 ∈ wcel 2146 ≠ wne 2345 ∅c0 3420 class class class wbr 3998 suc csuc 4359 ωcom 4583 ≈ cen 6728 |
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 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-13 2148 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-nul 4124 ax-pow 4169 ax-pr 4203 ax-un 4427 ax-setind 4530 ax-iinf 4581 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ne 2346 df-ral 2458 df-rex 2459 df-rab 2462 df-v 2737 df-sbc 2961 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-nul 3421 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-uni 3806 df-int 3841 df-br 3999 df-opab 4060 df-tr 4097 df-id 4287 df-iord 4360 df-on 4362 df-suc 4365 df-iom 4584 df-xp 4626 df-rel 4627 df-cnv 4628 df-co 4629 df-dm 4630 df-rn 4631 df-res 4632 df-ima 4633 df-iota 5170 df-fun 5210 df-fn 5211 df-f 5212 df-f1 5213 df-fo 5214 df-f1o 5215 df-fv 5216 df-er 6525 df-en 6731 |
This theorem is referenced by: snnen2og 6849 1nen2 6851 php5dom 6853 php5fin 6872 |
Copyright terms: Public domain | W3C validator |