Metamath Proof Explorer


Theorem zmulcl

Description: Closure of multiplication of integers. (Contributed by NM, 30-Jul-2004)

Ref Expression
Assertion zmulcl ⊢ M ∈ ℤ ∧ N ∈ ℤ → M ⋅ N ∈ ℤ

Proof

Step Hyp Ref Expression
1 elznn0 ⊢ M ∈ ℤ ↔ M ∈ ℝ ∧ M ∈ ℕ 0 ∨ − M ∈ ℕ 0
2 elznn0 ⊢ N ∈ ℤ ↔ N ∈ ℝ ∧ N ∈ ℕ 0 ∨ − N ∈ ℕ 0
3 nn0mulcl ⊢ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0
4 3 orcd ⊢ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
5 4 a1i ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
6 remulcl ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ⋅ N ∈ ℝ
7 5 6 jctild ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
8 nn0mulcl ⊢ − M ∈ ℕ 0 ∧ N ∈ ℕ 0 → -M ⋅ N ∈ ℕ 0
9 recn ⊢ M ∈ ℝ → M ∈ ℂ
10 recn ⊢ N ∈ ℝ → N ∈ ℂ
11 mulneg1 ⊢ M ∈ ℂ ∧ N ∈ ℂ → -M ⋅ N = − M ⋅ N
12 9 10 11 syl2an ⊢ M ∈ ℝ ∧ N ∈ ℝ → -M ⋅ N = − M ⋅ N
13 12 eleq1d ⊢ M ∈ ℝ ∧ N ∈ ℝ → -M ⋅ N ∈ ℕ 0 ↔ − M ⋅ N ∈ ℕ 0
14 8 13 imbitrid ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ N ∈ ℕ 0 → − M ⋅ N ∈ ℕ 0
15 olc ⊢ − M ⋅ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
16 14 15 syl6 ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
17 16 6 jctild ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
18 nn0mulcl ⊢ M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⁢ -N ∈ ℕ 0
19 mulneg2 ⊢ M ∈ ℂ ∧ N ∈ ℂ → M ⁢ -N = − M ⋅ N
20 9 10 19 syl2an ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ⁢ -N = − M ⋅ N
21 20 eleq1d ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ⁢ -N ∈ ℕ 0 ↔ − M ⋅ N ∈ ℕ 0
22 18 21 imbitrid ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → − M ⋅ N ∈ ℕ 0
23 22 15 syl6 ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
24 23 6 jctild ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
25 nn0mulcl ⊢ − M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → -M ⁢ -N ∈ ℕ 0
26 mul2neg ⊢ M ∈ ℂ ∧ N ∈ ℂ → -M ⁢ -N = M ⋅ N
27 9 10 26 syl2an ⊢ M ∈ ℝ ∧ N ∈ ℝ → -M ⁢ -N = M ⋅ N
28 27 eleq1d ⊢ M ∈ ℝ ∧ N ∈ ℝ → -M ⁢ -N ∈ ℕ 0 ↔ M ⋅ N ∈ ℕ 0
29 25 28 imbitrid ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0
30 orc ⊢ M ⋅ N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
31 29 30 syl6 ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
32 31 6 jctild ⊢ M ∈ ℝ ∧ N ∈ ℝ → − M ∈ ℕ 0 ∧ − N ∈ ℕ 0 → M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
33 7 17 24 32 ccased ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∨ − M ∈ ℕ 0 ∧ N ∈ ℕ 0 ∨ − N ∈ ℕ 0 → M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
34 elznn0 ⊢ M ⋅ N ∈ ℤ ↔ M ⋅ N ∈ ℝ ∧ M ⋅ N ∈ ℕ 0 ∨ − M ⋅ N ∈ ℕ 0
35 33 34 imbitrrdi ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ∈ ℕ 0 ∨ − M ∈ ℕ 0 ∧ N ∈ ℕ 0 ∨ − N ∈ ℕ 0 → M ⋅ N ∈ ℤ
36 35 imp ⊢ M ∈ ℝ ∧ N ∈ ℝ ∧ M ∈ ℕ 0 ∨ − M ∈ ℕ 0 ∧ N ∈ ℕ 0 ∨ − N ∈ ℕ 0 → M ⋅ N ∈ ℤ
37 36 an4s ⊢ M ∈ ℝ ∧ M ∈ ℕ 0 ∨ − M ∈ ℕ 0 ∧ N ∈ ℝ ∧ N ∈ ℕ 0 ∨ − N ∈ ℕ 0 → M ⋅ N ∈ ℤ
38 1 2 37 syl2anb ⊢ M ∈ ℤ ∧ N ∈ ℤ → M ⋅ N ∈ ℤ