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

Theorem nnaddscl 28306
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 28304 . . . 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 28286 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 No )
5 simprl 770 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 ∈ ℕ0s)
65n0snod 28286 . . . 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 27984 . . 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 28301 . . 3 (𝐴 ∈ ℕs ↔ (𝐴 ∈ ℕ0s ∧ 0s <s 𝐴))
12 elnns2 28301 . . 3 (𝐵 ∈ ℕs ↔ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵))
1311, 12anbi12i 628 . 2 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) ↔ ((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)))
14 elnns2 28301 . 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 2113   class class class wbr 5096  (class class class)co 7356   <s cslt 27606   0s c0s 27793   +s cadds 27929  0scnn0s 28273  scnns 28274
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-ot 4587  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  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 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-nadd 8592  df-no 27608  df-slt 27609  df-bday 27610  df-sle 27711  df-sslt 27748  df-scut 27750  df-0s 27795  df-1s 27796  df-made 27815  df-old 27816  df-left 27818  df-right 27819  df-norec2 27919  df-adds 27930  df-n0s 28275  df-nns 28276
This theorem is referenced by:  peano2nns  28310  zaddscl  28352  zmulscld  28355  readdscl  28444
  Copyright terms: Public domain W3C validator