| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnsuc | Structured version Visualization version GIF version | ||
| Description: A nonzero natural number is a successor. (Contributed by NM, 18-Feb-2004.) |
| Ref | Expression |
|---|---|
| nnsuc | ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnlim 7862 | . . . 4 ⊢ (𝐴 ∈ ω → ¬ Lim 𝐴) | |
| 2 | 1 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ¬ Lim 𝐴) |
| 3 | nnord 7856 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 4 | orduninsuc 7825 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
| 5 | 4 | adantr 484 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) |
| 6 | df-lim 6353 | . . . . . . 7 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) | |
| 7 | 6 | biimpri 230 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) → Lim 𝐴) |
| 8 | 7 | 3expia 1135 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 → Lim 𝐴)) |
| 9 | 5, 8 | sylbird 262 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 10 | 3, 9 | sylan 589 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 11 | 2, 10 | mt3d 148 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) |
| 12 | eleq1 2852 | . . . . . . . 8 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ ω ↔ suc 𝑥 ∈ ω)) | |
| 13 | 12 | biimpcd 251 | . . . . . . 7 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → suc 𝑥 ∈ ω)) |
| 14 | peano2b 7865 | . . . . . . 7 ⊢ (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω) | |
| 15 | 13, 14 | imbitrrdi 254 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → 𝑥 ∈ ω)) |
| 16 | 15 | ancrd 559 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 17 | 16 | adantld 494 | . . . 4 ⊢ (𝐴 ∈ ω → ((𝑥 ∈ On ∧ 𝐴 = suc 𝑥) → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 18 | 17 | reximdv2 3174 | . . 3 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 19 | 18 | adantr 484 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 20 | 11, 19 | mpd 15 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ≠ wne 2959 ∃wrex 3088 ∅c0 4287 ∪ cuni 4867 Ord word 6347 Oncon0 6348 Lim wlim 6349 suc csuc 6350 ωcom 7848 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-tr 5210 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-om 7849 |
| This theorem is referenced by: peano5 7876 nn0suc 7877 inf3lemd 9584 infpssrlem4 10265 fin1a2lem6 10364 bnj158 35027 bnj1098 35081 bnj594 35209 fineqvnttrclse 35424 gonar 35750 goalr 35752 satffun 35764 |
| Copyright terms: Public domain | W3C validator |