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

Theorem nn1m1nns 28354
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 2741 . . 3 (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s ))
2 oveq1 7365 . . . 4 (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s ))
32eleq1d 2822 . . 3 (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs))
41, 3orbi12d 919 . 2 (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)))
5 eqeq1 2741 . . 3 (𝑥 = 𝑦 → (𝑥 = 1s𝑦 = 1s ))
6 oveq1 7365 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2822 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs))
85, 7orbi12d 919 . 2 (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs)))
9 eqeq1 2741 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s ))
10 oveq1 7365 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2822 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
129, 11orbi12d 919 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
13 eqeq1 2741 . . 3 (𝑥 = 𝐴 → (𝑥 = 1s𝐴 = 1s ))
14 oveq1 7365 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2822 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs))
1613, 15orbi12d 919 . 2 (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)))
17 eqid 2737 . . 3 1s = 1s
1817orci 866 . 2 ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)
19 nnno 28304 . . . . . 6 (𝑦 ∈ ℕs𝑦 No )
20 1no 27790 . . . . . 6 1s No
21 pncans 28052 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 587 . . . . 5 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 22 . . . . 5 (𝑦 ∈ ℕs𝑦 ∈ ℕs)
2422, 23eqeltrd 2837 . . . 4 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)
2524olcd 875 . . 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 28353 1 (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 848   = wceq 1542  wcel 2114  (class class class)co 7358   No csur 27591   1s c1s 27786   +s cadds 27939   -s csubs 28000  scnns 28293
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 5300  ax-pr 5368  ax-un 7680
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 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-2o 8397  df-nadd 8593  df-no 27594  df-lts 27595  df-bday 27596  df-les 27697  df-slts 27738  df-cuts 27740  df-0s 27787  df-1s 27788  df-made 27807  df-old 27808  df-left 27810  df-right 27811  df-norec 27918  df-norec2 27929  df-adds 27940  df-negs 28001  df-subs 28002  df-n0s 28294  df-nns 28295
This theorem is referenced by:  nnm1n0s  28355
  Copyright terms: Public domain W3C validator