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

Theorem nn1m1nns 28269
Description: Every positive surreal integer is either one or a successor. (Contributed by Scott Fenton, 8-Nov-2025.)
Assertion
Ref Expression
nn1m1nns (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))

Proof of Theorem nn1m1nns
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqeq1 2734 . . 3 (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s ))
2 oveq1 7396 . . . 4 (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s ))
32eleq1d 2814 . . 3 (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs))
41, 3orbi12d 918 . 2 (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)))
5 eqeq1 2734 . . 3 (𝑥 = 𝑦 → (𝑥 = 1s𝑦 = 1s ))
6 oveq1 7396 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2814 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs))
85, 7orbi12d 918 . 2 (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs)))
9 eqeq1 2734 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s ))
10 oveq1 7396 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2814 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
129, 11orbi12d 918 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
13 eqeq1 2734 . . 3 (𝑥 = 𝐴 → (𝑥 = 1s𝐴 = 1s ))
14 oveq1 7396 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2814 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs))
1613, 15orbi12d 918 . 2 (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)))
17 eqid 2730 . . 3 1s = 1s
1817orci 865 . 2 ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)
19 nnsno 28223 . . . . . 6 (𝑦 ∈ ℕs𝑦 No )
20 1sno 27745 . . . . . 6 1s No
21 pncans 27982 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 586 . . . . 5 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 22 . . . . 5 (𝑦 ∈ ℕs𝑦 ∈ ℕs)
2422, 23eqeltrd 2829 . . . 4 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)
2524olcd 874 . . 3 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
2625a1d 25 . 2 (𝑦 ∈ ℕs → ((𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs) → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
274, 8, 12, 16, 18, 26nnsind 28268 1 (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 847   = wceq 1540  wcel 2109  (class class class)co 7389   No csur 27557   1s c1s 27741   +s cadds 27872   -s csubs 27932  scnns 28213
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-ot 4600  df-uni 4874  df-int 4913  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-se 5594  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6276  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-riota 7346  df-ov 7392  df-oprab 7393  df-mpo 7394  df-om 7845  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8380  df-1o 8436  df-2o 8437  df-nadd 8632  df-no 27560  df-slt 27561  df-bday 27562  df-sle 27663  df-sslt 27699  df-scut 27701  df-0s 27742  df-1s 27743  df-made 27761  df-old 27762  df-left 27764  df-right 27765  df-norec 27851  df-norec2 27862  df-adds 27873  df-negs 27933  df-subs 27934  df-n0s 28214  df-nns 28215
This theorem is referenced by:  nnm1n0s  28270
  Copyright terms: Public domain W3C validator