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

Theorem nnaddscl 28356
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 28354 . . . 4 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 +s 𝐵) ∈ ℕ0s)
21ad2ant2r 753 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → (𝐴 +s 𝐵) ∈ ℕ0s)
3 simpll 772 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 ∈ ℕ0s)
43n0nod 28335 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐴 No )
5 simprl 776 . . . . 5 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 ∈ ℕ0s)
65n0nod 28335 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 𝐵 No )
7 simplr 774 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐴)
8 simprr 778 . . . 4 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s 𝐵)
94, 6, 7, 8addsgt0d 28024 . . 3 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → 0s <s (𝐴 +s 𝐵))
102, 9jca 516 . 2 (((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)) → ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
11 elnns2 28351 . . 3 (𝐴 ∈ ℕs ↔ (𝐴 ∈ ℕ0s ∧ 0s <s 𝐴))
12 elnns2 28351 . . 3 (𝐵 ∈ ℕs ↔ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵))
1311, 12anbi12i 634 . 2 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) ↔ ((𝐴 ∈ ℕ0s ∧ 0s <s 𝐴) ∧ (𝐵 ∈ ℕ0s ∧ 0s <s 𝐵)))
14 elnns2 28351 . 2 ((𝐴 +s 𝐵) ∈ ℕs ↔ ((𝐴 +s 𝐵) ∈ ℕ0s ∧ 0s <s (𝐴 +s 𝐵)))
1510, 13, 143imtr4i 293 1 ((𝐴 ∈ ℕs𝐵 ∈ ℕs) → (𝐴 +s 𝐵) ∈ ℕs)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wcel 2119   class class class wbr 5072  (class class class)co 7356   <s clts 27622   0s c0s 27815   +s cadds 27969  0scn0s 28322  scnns 28323
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-ot 4564  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  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 27624  df-lts 27625  df-bday 27626  df-les 27727  df-slts 27768  df-cuts 27770  df-0s 27817  df-1s 27818  df-made 27837  df-old 27838  df-left 27840  df-right 27841  df-norec2 27959  df-adds 27970  df-n0s 28324  df-nns 28325
This theorem is referenced by:  peano2nns  28360  zaddscl  28404  zmulscld  28407  readdscl  28509
  Copyright terms: Public domain W3C validator