Metamath Proof Explorer


Theorem smucl

Description: The product of two sequences is a sequence. (Contributed by Mario Carneiro, 19-Sep-2016)

Ref Expression
Assertion smucl ⊢ A ⊆ ℕ 0 ∧ B ⊆ ℕ 0 → A smul B ⊆ ℕ 0

Proof

Step Hyp Ref Expression
1 simpl ⊢ A ⊆ ℕ 0 ∧ B ⊆ ℕ 0 → A ⊆ ℕ 0
2 simpr ⊢ A ⊆ ℕ 0 ∧ B ⊆ ℕ 0 → B ⊆ ℕ 0
3 eqid ⊢ seq 0 p ∈ 𝒫 ℕ 0 , m ∈ ℕ 0 ⟼ p sadd n ∈ ℕ 0 | m ∈ A ∧ n − m ∈ B n ∈ ℕ 0 ⟼ if n = 0 ∅ n − 1 = seq 0 p ∈ 𝒫 ℕ 0 , m ∈ ℕ 0 ⟼ p sadd n ∈ ℕ 0 | m ∈ A ∧ n − m ∈ B n ∈ ℕ 0 ⟼ if n = 0 ∅ n − 1
4 1 2 3 smufval ⊢ A ⊆ ℕ 0 ∧ B ⊆ ℕ 0 → A smul B = k ∈ ℕ 0 | k ∈ seq 0 p ∈ 𝒫 ℕ 0 , m ∈ ℕ 0 ⟼ p sadd n ∈ ℕ 0 | m ∈ A ∧ n − m ∈ B n ∈ ℕ 0 ⟼ if n = 0 ∅ n − 1 ⁡ k + 1
5 ssrab2 ⊢ k ∈ ℕ 0 | k ∈ seq 0 p ∈ 𝒫 ℕ 0 , m ∈ ℕ 0 ⟼ p sadd n ∈ ℕ 0 | m ∈ A ∧ n − m ∈ B n ∈ ℕ 0 ⟼ if n = 0 ∅ n − 1 ⁡ k + 1 ⊆ ℕ 0
6 4 5 eqsstrdi ⊢ A ⊆ ℕ 0 ∧ B ⊆ ℕ 0 → A smul B ⊆ ℕ 0