MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  n0s0m1 Structured version   Visualization version   GIF version

Theorem n0s0m1 28442
Description: Every non-negative surreal integer is either zero or a successor. (Contributed by Scott Fenton, 26-May-2025.)
Assertion
Ref Expression
n0s0m1 (𝐴 ∈ ℕ0s → (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s))

Proof of Theorem n0s0m1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqeq1 2765 . . 3 (𝑥 = 0s → (𝑥 = 0s ↔ 0s = 0s ))
2 oveq1 7397 . . . 4 (𝑥 = 0s → (𝑥 -s 1s ) = ( 0s -s 1s ))
32eleq1d 2846 . . 3 (𝑥 = 0s → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ( 0s -s 1s ) ∈ ℕ0s))
41, 3orbi12d 929 . 2 (𝑥 = 0s → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)))
5 eqeq1 2765 . . 3 (𝑥 = 𝑦 → (𝑥 = 0s𝑦 = 0s ))
6 oveq1 7397 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2846 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝑦 -s 1s ) ∈ ℕ0s))
85, 7orbi12d 929 . 2 (𝑥 = 𝑦 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s)))
9 eqeq1 2765 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 0s ↔ (𝑦 +s 1s ) = 0s ))
10 oveq1 7397 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2846 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s))
129, 11orbi12d 929 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)))
13 eqeq1 2765 . . 3 (𝑥 = 𝐴 → (𝑥 = 0s𝐴 = 0s ))
14 oveq1 7397 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2846 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝐴 -s 1s ) ∈ ℕ0s))
1613, 15orbi12d 929 . 2 (𝑥 = 𝐴 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s)))
17 eqid 2761 . . 3 0s = 0s
1817orci 876 . 2 ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)
19 n0no 28403 . . . . . 6 (𝑦 ∈ ℕ0s𝑦 No )
20 1no 27890 . . . . . 6 1s No
21 pncans 28152 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 595 . . . . 5 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 22 . . . . 5 (𝑦 ∈ ℕ0s𝑦 ∈ ℕ0s)
2422, 23eqeltrd 2861 . . . 4 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)
2524olcd 885 . . 3 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s))
2625a1d 25 . 2 (𝑦 ∈ ℕ0s → ((𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s) → ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)))
274, 8, 12, 16, 18, 26n0sind 28413 1 (𝐴 ∈ ℕ0s → (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 858   = wceq 1559  wcel 2141  (class class class)co 7390   No csur 27691   0s c0s 27885   1s c1s 27886   +s cadds 28039   -s csubs 28100  0scn0s 28392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7841  df-1st 7964  df-2nd 7965  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-1o 8430  df-2o 8431  df-nadd 8629  df-no 27694  df-lts 27695  df-bday 27696  df-les 27796  df-slts 27838  df-cuts 27840  df-0s 27887  df-1s 27888  df-made 27907  df-old 27908  df-left 27910  df-right 27911  df-norec 28018  df-norec2 28029  df-adds 28040  df-negs 28101  df-subs 28102  df-n0s 28394
This theorem is referenced by:  n0subs  28443
  Copyright terms: Public domain W3C validator