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

Theorem n0s0m1 28368
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 2741 . . 3 (𝑥 = 0s → (𝑥 = 0s ↔ 0s = 0s ))
2 oveq1 7367 . . . 4 (𝑥 = 0s → (𝑥 -s 1s ) = ( 0s -s 1s ))
32eleq1d 2822 . . 3 (𝑥 = 0s → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ( 0s -s 1s ) ∈ ℕ0s))
41, 3orbi12d 919 . 2 (𝑥 = 0s → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)))
5 eqeq1 2741 . . 3 (𝑥 = 𝑦 → (𝑥 = 0s𝑦 = 0s ))
6 oveq1 7367 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2822 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝑦 -s 1s ) ∈ ℕ0s))
85, 7orbi12d 919 . 2 (𝑥 = 𝑦 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s)))
9 eqeq1 2741 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 0s ↔ (𝑦 +s 1s ) = 0s ))
10 oveq1 7367 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2822 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕ0s ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s))
129, 11orbi12d 919 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ ((𝑦 +s 1s ) = 0s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)))
13 eqeq1 2741 . . 3 (𝑥 = 𝐴 → (𝑥 = 0s𝐴 = 0s ))
14 oveq1 7367 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2822 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝐴 -s 1s ) ∈ ℕ0s))
1613, 15orbi12d 919 . 2 (𝑥 = 𝐴 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s)))
17 eqid 2737 . . 3 0s = 0s
1817orci 866 . 2 ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)
19 n0no 28329 . . . . . 6 (𝑦 ∈ ℕ0s𝑦 No )
20 1no 27816 . . . . . 6 1s No
21 pncans 28078 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 587 . . . . 5 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 22 . . . . 5 (𝑦 ∈ ℕ0s𝑦 ∈ ℕ0s)
2422, 23eqeltrd 2837 . . . 4 (𝑦 ∈ ℕ0s → ((𝑦 +s 1s ) -s 1s ) ∈ ℕ0s)
2524olcd 875 . . 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 28339 1 (𝐴 ∈ ℕ0s → (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 848   = wceq 1542  wcel 2114  (class class class)co 7360   No csur 27617   0s c0s 27811   1s c1s 27812   +s cadds 27965   -s csubs 28026  0scn0s 28318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-nadd 8595  df-no 27620  df-lts 27621  df-bday 27622  df-les 27723  df-slts 27764  df-cuts 27766  df-0s 27813  df-1s 27814  df-made 27833  df-old 27834  df-left 27836  df-right 27837  df-norec 27944  df-norec2 27955  df-adds 27966  df-negs 28027  df-subs 28028  df-n0s 28320
This theorem is referenced by:  n0subs  28369
  Copyright terms: Public domain W3C validator