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 2943 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅) | |
2 | nnsuc 7705 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) | |
3 | 1, 2 | sylan2br 594 | . . 3 ⊢ ((𝐴 ∈ ω ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ ω 𝐴 = suc 𝑥) |
4 | 3 | ex 412 | . 2 ⊢ (𝐴 ∈ ω → (¬ 𝐴 = ∅ → ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
5 | 4 | orrd 859 | 1 ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 843 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∃wrex 3064 ∅c0 4253 suc csuc 6253 ωcom 7687 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-tr 5188 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-om 7688 |
This theorem is referenced by: nnawordex 8430 nneneq 8896 php 8897 cantnfvalf 9353 cantnflt 9360 trpredlem1 9405 trpred0 9410 trpredrec 9415 hsmexlem9 10112 winainflem 10380 bnj517 32765 nnuni 33595 ttrclselem1 33711 ttrclselem2 33712 |
Copyright terms: Public domain | W3C validator |