Theorem n0mulscl 28611

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

Assertion

Ref	Expression
n0mulscl	⊢ ((𝐴 ∈ ℕ0s ∧ 𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)

Proof of Theorem n0mulscl

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

Step	Hyp	Ref	Expression
1		oveq2 7422	. . . . 5 ⊢ (𝑛 = 0s → (𝐴 ·s 𝑛) = (𝐴 ·s 0s ))
2	1	eleq1d 2845	. . . 4 ⊢ (𝑛 = 0s → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 0s ) ∈ ℕ0s))
3	2	imbi2d 343	. . 3 ⊢ (𝑛 = 0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)))
4		oveq2 7422	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝑚))
5	4	eleq1d 2845	. . . 4 ⊢ (𝑛 = 𝑚 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝑚) ∈ ℕ0s))
6	5	imbi2d 343	. . 3 ⊢ (𝑛 = 𝑚 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s)))
7		oveq2 7422	. . . . 5 ⊢ (𝑛 = (𝑚 +s 1s ) → (𝐴 ·s 𝑛) = (𝐴 ·s (𝑚 +s 1s )))
8	7	eleq1d 2845	. . . 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 7422	. . . . 5 ⊢ (𝑛 = 𝐵 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝐵))
11	10	eleq1d 2845	. . . 4 ⊢ (𝑛 = 𝐵 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝐵) ∈ ℕ0s))
12	11	imbi2d 343	. . 3 ⊢ (𝑛 = 𝐵 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s)))
13		n0no 28589	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ No )
14		muls01 28378	. . . . 5 ⊢ (𝐴 ∈ No → (𝐴 ·s 0s ) = 0s )
15	13, 14	syl 18	. . . 4 ⊢ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) = 0s )
16		0n0s 28595	. . . 4 ⊢ 0s ∈ ℕ0s
17	15, 16	eqeltrdi 2868	. . 3 ⊢ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)
18	13	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝐴 ∈ No )
19		n0no 28589	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ0s → 𝑚 ∈ No )
20	19	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝑚 ∈ No )
21		1no 28076	. . . . . . . . . 10 ⊢ 1s ∈ No
22	21	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 1s ∈ No )
23	18, 20, 22	addsdid 28422	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )))
24	13	mulsridd 28380	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ0s → (𝐴 ·s 1s ) = 𝐴)
25	24	oveq2d 7430	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
26	25	ad2antrr 739	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
27	23, 26	eqtrd 2795	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
28		n0addscl 28610	. . . . . . . . 9 ⊢ (((𝐴 ·s 𝑚) ∈ ℕ0s ∧ 𝐴 ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
29	28	ancoms 464	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0s ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
30	29	adantlr 728	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
31	27, 30	eqeltrd 2860	. . . . . 6 ⊢ (((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)
32	31	ex 418	. . . . 5 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
33	32	expcom 419	. . . 4 ⊢ (𝑚 ∈ ℕ0s → (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
34	33	a2d 30	. . 3 ⊢ (𝑚 ∈ ℕ0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
35	3, 6, 9, 12, 17, 34	n0sind 28599	. 2 ⊢ (𝐵 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s))
36	35	impcom 413	1 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  (class class class)co 7414   No csur 27877   0_s c0s 28071   1_s c1s 28072   +_s cadds 28225   ·_s cmuls 28372  ℕ_0scn0s 28578

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8456  df-2o 8457  df-nadd 8655  df-no 27880  df-lts 27881  df-bday 27882  df-les 27982  df-slts 28024  df-cuts 28026  df-0s 28073  df-1s 28074  df-made 28093  df-old 28094  df-left 28096  df-right 28097  df-norec 28204  df-norec2 28215  df-adds 28226  df-negs 28287  df-subs 28288  df-muls 28373  df-n0s 28580

This theorem is used by:  nnmulscl  28613  eucliddivs  28642  n0expscl  28698  addhalfcut  28725  bdaypw2n0bndlem  28729  bdayfinbndlem1  28733  z12bdaylem2  28737  z12sge0  28749