Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nn0suc | Structured version Visualization version GIF version |
Description: A natural number is either 0 or a successor. (Contributed by NM, 27-May-1998.) |
Ref | Expression |
---|---|
nn0suc | ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ne 2782 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅) | |
2 | nnsuc 6974 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) | |
3 | 1, 2 | sylan2br 492 | . . 3 ⊢ ((𝐴 ∈ ω ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
4 | 3 | ex 449 | . 2 ⊢ (𝐴 ∈ ω → (¬ 𝐴 = ∅ → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
5 | 4 | orrd 392 | 1 ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 382 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∃wrex 2897 ∅c0 3874 suc csuc 5642 ωcom 6957 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-tr 4681 df-eprel 4949 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-om 6958 |
This theorem is referenced by: nnawordex 7604 nneneq 8028 php 8029 cantnfvalf 8445 cantnflt 8452 hsmexlem9 9130 winainflem 9394 bnj517 30209 trpredlem1 30971 trpred0 30980 trpredrec 30982 |
Copyright terms: Public domain | W3C validator |