| 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 7874 | . . . 4 ⊢ (𝐴 ∈ ω → ¬ Lim 𝐴) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ¬ Lim 𝐴) |
| 3 | nnord 7868 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 4 | orduninsuc 7837 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
| 5 | 4 | adantr 486 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) |
| 6 | df-lim 6356 | . . . . . . 7 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) | |
| 7 | 6 | biimpri 231 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) → Lim 𝐴) |
| 8 | 7 | 3expia 1139 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 → Lim 𝐴)) |
| 9 | 5, 8 | sylbird 263 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 10 | 3, 9 | sylan 592 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 11 | 2, 10 | mt3d 149 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) |
| 12 | eleq1 2848 | . . . . . . . 8 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ ω ↔ suc 𝑥 ∈ ω)) | |
| 13 | 12 | biimpcd 252 | . . . . . . 7 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → suc 𝑥 ∈ ω)) |
| 14 | peano2b 7877 | . . . . . . 7 ⊢ (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω) | |
| 15 | 13, 14 | imbitrrdi 255 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → 𝑥 ∈ ω)) |
| 16 | 15 | ancrd 561 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 17 | 16 | adantld 496 | . . . 4 ⊢ (𝐴 ∈ ω → ((𝑥 ∈ On ∧ 𝐴 = suc 𝑥) → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 18 | 17 | reximdv2 3172 | . . 3 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 19 | 18 | adantr 486 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 20 | 11, 19 | mpd 16 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∃wrex 3086 ∅c0 4278 ∪ cuni 4866 Ord word 6350 Oncon0 6351 Lim wlim 6352 suc csuc 6353 ωcom 7860 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-om 7861 |
| This theorem is used by: peano5 7888 nn0suc 7889 inf3lemd 9606 infpssrlem4 10355 fin1a2lem6 10454 bnj158 35294 bnj1098 35348 bnj594 35476 fineqvnttrclse 35717 gonar 36081 goalr 36083 satffun 36095 mh-inf3f1 37251 |
| Copyright terms: Public domain | W3C validator |