Theorem n0addscl 28537

Description: The non-negative surreal integers are closed under addition. (Contributed by Scott Fenton, 15-Apr-2025.)

Assertion

Ref	Expression
n0addscl	⊢ ((𝐴 ∈ ℕ0s ∧ 𝐵 ∈ ℕ0s) → (𝐴 +s 𝐵) ∈ ℕ0s)

Proof of Theorem n0addscl

Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7418	. . . . 5 ⊢ (𝑛 = 0s → (𝐴 +s 𝑛) = (𝐴 +s 0s ))
2	1	eleq1d 2848	. . . 4 ⊢ (𝑛 = 0s → ((𝐴 +s 𝑛) ∈ ℕ0s ↔ (𝐴 +s 0s ) ∈ ℕ0s))
3	2	imbi2d 343	. . 3 ⊢ (𝑛 = 0s → ((𝐴 ∈ ℕ0s → (𝐴 +s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 +s 0s ) ∈ ℕ0s)))
4		oveq2 7418	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝐴 +s 𝑛) = (𝐴 +s 𝑚))
5	4	eleq1d 2848	. . . 4 ⊢ (𝑛 = 𝑚 → ((𝐴 +s 𝑛) ∈ ℕ0s ↔ (𝐴 +s 𝑚) ∈ ℕ0s))
6	5	imbi2d 343	. . 3 ⊢ (𝑛 = 𝑚 → ((𝐴 ∈ ℕ0s → (𝐴 +s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 +s 𝑚) ∈ ℕ0s)))
7		oveq2 7418	. . . . 5 ⊢ (𝑛 = (𝑚 +s 1s ) → (𝐴 +s 𝑛) = (𝐴 +s (𝑚 +s 1s )))
8	7	eleq1d 2848	. . . 4 ⊢ (𝑛 = (𝑚 +s 1s ) → ((𝐴 +s 𝑛) ∈ ℕ0s ↔ (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s))
9	8	imbi2d 343	. . 3 ⊢ (𝑛 = (𝑚 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 +s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s)))
10		oveq2 7418	. . . . 5 ⊢ (𝑛 = 𝐵 → (𝐴 +s 𝑛) = (𝐴 +s 𝐵))
11	10	eleq1d 2848	. . . 4 ⊢ (𝑛 = 𝐵 → ((𝐴 +s 𝑛) ∈ ℕ0s ↔ (𝐴 +s 𝐵) ∈ ℕ0s))
12	11	imbi2d 343	. . 3 ⊢ (𝑛 = 𝐵 → ((𝐴 ∈ ℕ0s → (𝐴 +s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 +s 𝐵) ∈ ℕ0s)))
13		n0no 28516	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ No )
14	13	addsridd 28158	. . . 4 ⊢ (𝐴 ∈ ℕ0s → (𝐴 +s 0s ) = 𝐴)
15		id 23	. . . 4 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ ℕ0s)
16	14, 15	eqeltrd 2863	. . 3 ⊢ (𝐴 ∈ ℕ0s → (𝐴 +s 0s ) ∈ ℕ0s)
17	13	adantr 485	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) → 𝐴 ∈ No )
18	17	adantr 485	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → 𝐴 ∈ No )
19		n0no 28516	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ0s → 𝑚 ∈ No )
20	19	adantl 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) → 𝑚 ∈ No )
21	20	adantr 485	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → 𝑚 ∈ No )
22		1no 28003	. . . . . . . . 9 ⊢ 1s ∈ No
23	22	a1i 11	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → 1s ∈ No )
24	18, 21, 23	addsassd 28199	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → ((𝐴 +s 𝑚) +s 1s ) = (𝐴 +s (𝑚 +s 1s )))
25		peano2n0s 28523	. . . . . . . 8 ⊢ ((𝐴 +s 𝑚) ∈ ℕ0s → ((𝐴 +s 𝑚) +s 1s ) ∈ ℕ0s)
26	25	adantl 486	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → ((𝐴 +s 𝑚) +s 1s ) ∈ ℕ0s)
27	24, 26	eqeltrrd 2864	. . . . . 6 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 +s 𝑚) ∈ ℕ0s) → (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s)
28	27	ex 417	. . . . 5 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) → ((𝐴 +s 𝑚) ∈ ℕ0s → (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s))
29	28	expcom 418	. . . 4 ⊢ (𝑚 ∈ ℕ0s → (𝐴 ∈ ℕ0s → ((𝐴 +s 𝑚) ∈ ℕ0s → (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s)))
30	29	a2d 30	. . 3 ⊢ (𝑚 ∈ ℕ0s → ((𝐴 ∈ ℕ0s → (𝐴 +s 𝑚) ∈ ℕ0s) → (𝐴 ∈ ℕ0s → (𝐴 +s (𝑚 +s 1s )) ∈ ℕ0s)))
31	3, 6, 9, 12, 16, 30	n0sind 28526	. 2 ⊢ (𝐵 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 +s 𝐵) ∈ ℕ0s))
32	31	impcom 412	1 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝐵 ∈ ℕ0s) → (𝐴 +s 𝐵) ∈ ℕ0s)

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  (class class class)co 7410   No csur 27804   0_s c0s 27998   1_s c1s 27999   +_s cadds 28152  ℕ_0scn0s 28505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-nadd 8648  df-no 27807  df-lts 27808  df-bday 27809  df-les 27909  df-slts 27951  df-cuts 27953  df-0s 28000  df-1s 28001  df-made 28020  df-old 28021  df-left 28023  df-right 28024  df-norec2 28142  df-adds 28153  df-n0s 28507

This theorem is referenced by:  n0mulscl  28538  nnaddscl  28539  expadds  28628  pw2divscan4d  28637  addhalfcut  28652  bdaypw2n0bndlem  28656  bdaypw2bnd  28658  bdayfinbndlem1  28660  z12bdaylem2  28664  z12addscl  28670  z12sge0  28676