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

Theorem nn1m1nns 28474
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 2767 . . 3 (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s ))
2 oveq1 7403 . . . 4 (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s ))
32eleq1d 2848 . . 3 (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs))
41, 3orbi12d 929 . 2 (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)))
5 eqeq1 2767 . . 3 (𝑥 = 𝑦 → (𝑥 = 1s𝑦 = 1s ))
6 oveq1 7403 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2848 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs))
85, 7orbi12d 929 . 2 (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs)))
9 eqeq1 2767 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s ))
10 oveq1 7403 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2848 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
129, 11orbi12d 929 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
13 eqeq1 2767 . . 3 (𝑥 = 𝐴 → (𝑥 = 1s𝐴 = 1s ))
14 oveq1 7403 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2848 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs))
1613, 15orbi12d 929 . 2 (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)))
17 eqid 2763 . . 3 1s = 1s
1817orci 876 . 2 ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)
19 nnno 28424 . . . . . 6 (𝑦 ∈ ℕs𝑦 No )
20 1no 27910 . . . . . 6 1s No
21 pncans 28172 . . . . . 6 ((𝑦 No ∧ 1s No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 595 . . . . 5 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 22 . . . . 5 (𝑦 ∈ ℕs𝑦 ∈ ℕs)
2422, 23eqeltrd 2863 . . . 4 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)
2524olcd 885 . . 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 28473 1 (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 858   = wceq 1561  wcel 2143  (class class class)co 7396   No csur 27711   1s c1s 27906   +s cadds 28059   -s csubs 28120  scnns 28413
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-ot 4592  df-uni 4867  df-int 4907  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-se 5602  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-2o 8438  df-nadd 8636  df-no 27714  df-lts 27715  df-bday 27716  df-les 27816  df-slts 27858  df-cuts 27860  df-0s 27907  df-1s 27908  df-made 27927  df-old 27928  df-left 27930  df-right 27931  df-norec 28038  df-norec2 28049  df-adds 28060  df-negs 28121  df-subs 28122  df-n0s 28414  df-nns 28415
This theorem is referenced by:  nnm1n0s  28475
  Copyright terms: Public domain W3C validator