Metamath Proof Explorer


Theorem n0mulscl

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

Ref Expression
Assertion n0mulscl ⊢ A ∈ ℕ 0s ∧ B ∈ ℕ 0s → A ⋅ s B ∈ ℕ 0s

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ n = 0 s → A ⋅ s n = A ⋅ s 0 s
2 1 eleq1d ⊢ n = 0 s → A ⋅ s n ∈ ℕ 0s ↔ A ⋅ s 0 s ∈ ℕ 0s
3 2 imbi2d ⊢ n = 0 s → A ∈ ℕ 0s → A ⋅ s n ∈ ℕ 0s ↔ A ∈ ℕ 0s → A ⋅ s 0 s ∈ ℕ 0s
4 oveq2 ⊢ n = m → A ⋅ s n = A ⋅ s m
5 4 eleq1d ⊢ n = m → A ⋅ s n ∈ ℕ 0s ↔ A ⋅ s m ∈ ℕ 0s
6 5 imbi2d ⊢ n = m → A ∈ ℕ 0s → A ⋅ s n ∈ ℕ 0s ↔ A ∈ ℕ 0s → A ⋅ s m ∈ ℕ 0s
7 oveq2 ⊢ n = m + s 1 s → A ⋅ s n = A ⋅ s m + s 1 s
8 7 eleq1d ⊢ n = m + s 1 s → A ⋅ s n ∈ ℕ 0s ↔ A ⋅ s m + s 1 s ∈ ℕ 0s
9 8 imbi2d ⊢ n = m + s 1 s → A ∈ ℕ 0s → A ⋅ s n ∈ ℕ 0s ↔ A ∈ ℕ 0s → A ⋅ s m + s 1 s ∈ ℕ 0s
10 oveq2 ⊢ n = B → A ⋅ s n = A ⋅ s B
11 10 eleq1d ⊢ n = B → A ⋅ s n ∈ ℕ 0s ↔ A ⋅ s B ∈ ℕ 0s
12 11 imbi2d ⊢ n = B → A ∈ ℕ 0s → A ⋅ s n ∈ ℕ 0s ↔ A ∈ ℕ 0s → A ⋅ s B ∈ ℕ 0s
13 n0no ⊢ A ∈ ℕ 0s → A ∈ No
14 muls01 ⊢ A ∈ No → A ⋅ s 0 s = 0 s
15 13 14 syl ⊢ A ∈ ℕ 0s → A ⋅ s 0 s = 0 s
16 0n0s ⊢ 0 s ∈ ℕ 0s
17 15 16 eqeltrdi ⊢ A ∈ ℕ 0s → A ⋅ s 0 s ∈ ℕ 0s
18 13 ad2antrr ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ∈ No
19 n0no ⊢ m ∈ ℕ 0s → m ∈ No
20 19 ad2antlr ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → m ∈ No
21 1no ⊢ 1 s ∈ No
22 21 a1i ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → 1 s ∈ No
23 18 20 22 addsdid ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s 1 s = A ⋅ s m + s A ⋅ s 1 s
24 13 mulsridd ⊢ A ∈ ℕ 0s → A ⋅ s 1 s = A
25 24 oveq2d ⊢ A ∈ ℕ 0s → A ⋅ s m + s A ⋅ s 1 s = A ⋅ s m + s A
26 25 ad2antrr ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s A ⋅ s 1 s = A ⋅ s m + s A
27 23 26 eqtrd ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s 1 s = A ⋅ s m + s A
28 n0addscl ⊢ A ⋅ s m ∈ ℕ 0s ∧ A ∈ ℕ 0s → A ⋅ s m + s A ∈ ℕ 0s
29 28 ancoms ⊢ A ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s A ∈ ℕ 0s
30 29 adantlr ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s A ∈ ℕ 0s
31 27 30 eqeltrd ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s ∧ A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s 1 s ∈ ℕ 0s
32 31 ex ⊢ A ∈ ℕ 0s ∧ m ∈ ℕ 0s → A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s 1 s ∈ ℕ 0s
33 32 expcom ⊢ m ∈ ℕ 0s → A ∈ ℕ 0s → A ⋅ s m ∈ ℕ 0s → A ⋅ s m + s 1 s ∈ ℕ 0s
34 33 a2d ⊢ m ∈ ℕ 0s → A ∈ ℕ 0s → A ⋅ s m ∈ ℕ 0s → A ∈ ℕ 0s → A ⋅ s m + s 1 s ∈ ℕ 0s
35 3 6 9 12 17 34 n0sind ⊢ B ∈ ℕ 0s → A ∈ ℕ 0s → A ⋅ s B ∈ ℕ 0s
36 35 impcom ⊢ A ∈ ℕ 0s ∧ B ∈ ℕ 0s → A ⋅ s B ∈ ℕ 0s