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

Theorem n0s0m1 28741
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 7425 . . . 4 (𝑥 = 0s → (𝑥 -s 1s ) = ( 0s -s 1s ))
32eleq1d 2846 . . 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 2765 . . 3 (𝑥 = 𝑦 → (𝑥 = 0s ↔ 𝑦 = 0s ))
6 oveq1 7425 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2846 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝑦 -s 1s ) ∈ ℕ0s))
85, 7orbi12d 932 . 2 (𝑥 = 𝑦 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝑦 = 0s ∨ (𝑦 -s 1s ) ∈ ℕ0s)))
9 eqeq1 2765 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 0s ↔ (𝑦 +s 1s ) = 0s ))
10 oveq1 7425 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2846 . . 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 2765 . . 3 (𝑥 = 𝐴 → (𝑥 = 0s ↔ 𝐴 = 0s ))
14 oveq1 7425 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2846 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕ0s ↔ (𝐴 -s 1s ) ∈ ℕ0s))
1613, 15orbi12d 932 . 2 (𝑥 = 𝐴 → ((𝑥 = 0s ∨ (𝑥 -s 1s ) ∈ ℕ0s) ↔ (𝐴 = 0s ∨ (𝐴 -s 1s ) ∈ ℕ0s)))
17 eqid 2761 . . 3 0s = 0s
1817orci 879 . 2 ( 0s = 0s ∨ ( 0s -s 1s ) ∈ ℕ0s)
19 n0no 28702 . . . . . 6 (𝑦 ∈ ℕ0s → 𝑦 ∈ No )
20 1no 28189 . . . . . 6 1s ∈ No
21 pncans 28451 . . . . . 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 2861 . . . 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 28712 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 7418   No csur 27990   0s c0s 28184   1s c1s 28185   +s cadds 28338   -s csubs 28399  ℕ0scn0s 28691
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-2o 8470  df-nadd 8668  df-no 27993  df-lts 27994  df-bday 27995  df-les 28095  df-slts 28137  df-cuts 28139  df-0s 28186  df-1s 28187  df-made 28206  df-old 28207  df-left 28209  df-right 28210  df-norec 28317  df-norec2 28328  df-adds 28339  df-negs 28400  df-subs 28401  df-n0s 28693
This theorem is used by:  n0subs  28742
  Copyright terms: Public domain W3C validator