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

Theorem nnaddscl 28245
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 28243 . . . 4 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 +s 𝐵) ∈ ℕ0s)
21ad2ant2r 747 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → (𝐴 +s 𝐵) ∈ ℕ0s)
3 simpll 766 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 ∈ ℕ0s)
43n0snod 28225 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 No )
5 simprl 770 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 ∈ ℕ0s)
65n0snod 28225 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 No )
7 simplr 768 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐴)
8 simprr 772 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐵)
94, 6, 7, 8addsgt0d 27928 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s (𝐴 +s 𝐵))
102, 9jca 511 . 2 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
11 elnns2 28240 . . 3 (𝐴 ∈ ℕs ↔ (𝐴 ∈ ℕ0s ∧ 0s <s 𝐴))
12 elnns2 28240 . . 3 (𝐵 ∈ ℕs ↔ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵))
1311, 12anbi12i 628 . 2 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) ↔ ((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)))
14 elnns2 28240 . 2 ((𝐴 +s 𝐵) ∈ ℕs ↔ ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
1510, 13, 143imtr4i 292 1 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) → (𝐴 +s 𝐵) ∈ ℕs)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2109   class class class wbr 5110  (class class class)co 7390   <s cslt 27559   0s c0s 27741   +s cadds 27873  0scnn0s 28213  scnns 28214
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 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
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 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-tp 4597  df-op 4599  df-ot 4601  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-se 5595  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-1o 8437  df-2o 8438  df-nadd 8633  df-no 27561  df-slt 27562  df-bday 27563  df-sle 27664  df-sslt 27700  df-scut 27702  df-0s 27743  df-1s 27744  df-made 27762  df-old 27763  df-left 27765  df-right 27766  df-norec2 27863  df-adds 27874  df-n0s 28215  df-nns 28216
This theorem is referenced by:  peano2nns  28249  zaddscl  28289  zmulscld  28292  readdscl  28357
  Copyright terms: Public domain W3C validator