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

Theorem nnaddscl 28504
Description: The positive surreal integers are closed under addition. (Contributed by Scott Fenton, 15-Apr-2025.)
Assertion
Ref Expression
nnaddscl ((𝐴 ∈ ℕs𝐵 ∈ ℕs) → (𝐴 +s 𝐵) ∈ ℕs)

Proof of Theorem nnaddscl
StepHypRef Expression
1 n0addscl 28502 . . . 4 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 +s 𝐵) ∈ ℕ0s)
21ad2ant2r 759 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → (𝐴 +s 𝐵) ∈ ℕ0s)
3 simpll 778 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 ∈ ℕ0s)
43n0nod 28483 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 No )
5 simprl 782 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 ∈ ℕ0s)
65n0nod 28483 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 No )
7 simplr 780 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐴)
8 simprr 784 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐵)
94, 6, 7, 8addsgt0d 28172 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s (𝐴 +s 𝐵))
102, 9jca 520 . 2 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
11 elnns2 28499 . . 3 (𝐴 ∈ ℕs ↔ (𝐴 ∈ ℕ0s ∧ 0s <s 𝐴))
12 elnns2 28499 . . 3 (𝐵 ∈ ℕs ↔ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵))
1311, 12anbi12i 639 . 2 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) ↔ ((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)))
14 elnns2 28499 . 2 ((𝐴 +s 𝐵) ∈ ℕs ↔ ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
1510, 13, 143imtr4i 295 1 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) → (𝐴 +s 𝐵) ∈ ℕs)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wcel 2149   class class class wbr 5113  (class class class)co 7411   <s clts 27770   0s c0s 27963   +s cadds 28117  0scn0s 28470  scnns 28471
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-ot 4603  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8452  df-2o 8453  df-nadd 8651  df-no 27772  df-lts 27773  df-bday 27774  df-les 27874  df-slts 27916  df-cuts 27918  df-0s 27965  df-1s 27966  df-made 27985  df-old 27986  df-left 27988  df-right 27989  df-norec2 28107  df-adds 28118  df-n0s 28472  df-nns 28473
This theorem is referenced by:  peano2nns  28508  zaddscl  28552  zmulscld  28555  readdscl  28657
  Copyright terms: Public domain W3C validator