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

Theorem n0s0m1 28627
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 2764 . . 3 (𝑥 = 0s → (𝑥 = 0s ↔ 0s = 0s ))
2 oveq1 7420 . . . 4 (𝑥 = 0s → (𝑥 -s 1s ) = ( 0s -s 1s ))
32eleq1d 2845 . . 3 (𝑥 = 0s → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ( 0s -s 1s ) ∈ ℕ0s))
41, 3orbi12d 932 . 2 (𝑥 = 0s → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)))
5 eqeq1 2764 . . 3 (𝑥 = 𝑦 → (𝑥 = 0s𝑦 = 0s ))
6 oveq1 7420 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2845 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝑦 -s 1s ) ∈ ℕ0s))
85, 7orbi12d 932 . 2 (𝑥 = 𝑦 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s)))
9 eqeq1 2764 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 0s ↔ (𝑦 +s 1s ) = 0s ))
10 oveq1 7420 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2845 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s))
129, 11orbi12d 932 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)))
13 eqeq1 2764 . . 3 (𝑥 = 𝐴 → (𝑥 = 0s𝐴 = 0s ))
14 oveq1 7420 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2845 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝐴 -s 1s ) ∈ ℕ0s))
1613, 15orbi12d 932 . 2 (𝑥 = 𝐴 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s)))
17 eqid 2760 . . 3 0s = 0s
1817orci 879 . 2 ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)
19 n0no 28588 . . . . . 6 (𝑦 ∈ ℕ0s𝑦 No )
20 1no 28075 . . . . . 6 1s No
21 pncans 28337 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 598 . . . . 5 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 23 . . . . 5 (𝑦 ∈ ℕ0s𝑦 ∈ ℕ0s)
2422, 23eqeltrd 2860 . . . 4 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)
2524olcd 888 . . 3 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s))
2625a1d 26 . 2 (𝑦 ∈ ℕ0s → ((𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s) → ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)))
274, 8, 12, 16, 18, 26n0sind 28598 1 (𝐴 ∈ ℕ0s → (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wo 861   = wceq 1570  wcel 2145  (class class class)co 7413   No csur 27876   0s c0s 28070   1s c1s 28071   +s cadds 28224   -s csubs 28285  0scn0s 28577
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-nadd 8654  df-no 27879  df-lts 27880  df-bday 27881  df-les 27981  df-slts 28023  df-cuts 28025  df-0s 28072  df-1s 28073  df-made 28092  df-old 28093  df-left 28095  df-right 28096  df-norec 28203  df-norec2 28214  df-adds 28225  df-negs 28286  df-subs 28287  df-n0s 28579
This theorem is used by:  n0subs  28628
  Copyright terms: Public domain W3C validator