| 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 7856 | . . . 4 ⊢ (𝐴 ∈ ω → ¬ Lim 𝐴) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ¬ Lim 𝐴) |
| 3 | nnord 7850 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 4 | orduninsuc 7819 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
| 5 | 4 | adantr 480 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) |
| 6 | df-lim 6337 | . . . . . . 7 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) | |
| 7 | 6 | biimpri 228 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) → Lim 𝐴) |
| 8 | 7 | 3expia 1121 | . . . . 5 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (𝐴 = ∪ 𝐴 → Lim 𝐴)) |
| 9 | 5, 8 | sylbird 260 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 10 | 3, 9 | sylan 580 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → Lim 𝐴)) |
| 11 | 2, 10 | mt3d 148 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) |
| 12 | eleq1 2816 | . . . . . . . 8 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ ω ↔ suc 𝑥 ∈ ω)) | |
| 13 | 12 | biimpcd 249 | . . . . . . 7 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → suc 𝑥 ∈ ω)) |
| 14 | peano2b 7859 | . . . . . . 7 ⊢ (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω) | |
| 15 | 13, 14 | imbitrrdi 252 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → 𝑥 ∈ ω)) |
| 16 | 15 | ancrd 551 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐴 = suc 𝑥 → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 17 | 16 | adantld 490 | . . . 4 ⊢ (𝐴 ∈ ω → ((𝑥 ∈ On ∧ 𝐴 = suc 𝑥) → (𝑥 ∈ ω ∧ 𝐴 = suc 𝑥))) |
| 18 | 17 | reximdv2 3143 | . . 3 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 19 | 18 | adantr 480 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ On 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
| 20 | 11, 19 | mpd 15 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 ∅c0 4296 ∪ cuni 4871 Ord word 6331 Oncon0 6332 Lim wlim 6333 suc csuc 6334 ωcom 7842 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-tr 5215 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-om 7843 |
| This theorem is referenced by: peano5 7869 nn0suc 7870 inf3lemd 9580 infpssrlem4 10259 fin1a2lem6 10358 bnj158 34719 bnj1098 34773 bnj594 34902 gonar 35382 goalr 35384 satffun 35396 |
| Copyright terms: Public domain | W3C validator |