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

Theorem nn1m1nns 28693
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 2764 . . 3 (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s ))
2 oveq1 7415 . . . 4 (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s ))
32eleq1d 2845 . . 3 (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs))
41, 3orbi12d 932 . 2 (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)))
5 eqeq1 2764 . . 3 (𝑥 = 𝑦 → (𝑥 = 1s ↔ 𝑦 = 1s ))
6 oveq1 7415 . . . 4 (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s ))
76eleq1d 2845 . . 3 (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs))
85, 7orbi12d 932 . 2 (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs)))
9 eqeq1 2764 . . 3 (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s ))
10 oveq1 7415 . . . 4 (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s ))
1110eleq1d 2845 . . 3 (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
129, 11orbi12d 932 . 2 (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
13 eqeq1 2764 . . 3 (𝑥 = 𝐴 → (𝑥 = 1s ↔ 𝐴 = 1s ))
14 oveq1 7415 . . . 4 (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s ))
1514eleq1d 2845 . . 3 (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs))
1613, 15orbi12d 932 . 2 (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)))
17 eqid 2760 . . 3 1s = 1s
1817orci 879 . 2 ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs)
19 nnno 28643 . . . . . 6 (𝑦 ∈ ℕs → 𝑦 ∈ No )
20 1no 28129 . . . . . 6 1s ∈ No
21 pncans 28391 . . . . . 6 ((𝑦 ∈ No ∧ 1s ∈ No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
2219, 20, 21sylancl 598 . . . . 5 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦)
23 id 23 . . . . 5 (𝑦 ∈ ℕs → 𝑦 ∈ ℕs)
2422, 23eqeltrd 2860 . . . 4 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)
2524olcd 888 . . 3 (𝑦 ∈ ℕs → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))
2625a1d 26 . 2 (𝑦 ∈ ℕs → ((𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs) → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)))
274, 8, 12, 16, 18, 26nnsind 28692 1 (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2145  (class class class)co 7408   No csur 27930   1s c1s 28125   +s cadds 28278   -s csubs 28339  ℕscnns 28632
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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  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 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-2o 8455  df-nadd 8653  df-no 27933  df-lts 27934  df-bday 27935  df-les 28035  df-slts 28077  df-cuts 28079  df-0s 28126  df-1s 28127  df-made 28146  df-old 28147  df-left 28149  df-right 28150  df-norec 28257  df-norec2 28268  df-adds 28279  df-negs 28340  df-subs 28341  df-n0s 28633  df-nns 28634
This theorem is used by:  nnm1n0s  28694
  Copyright terms: Public domain W3C validator