Metamath Proof Explorer


Theorem uz2mulcl

Description: Closure of multiplication of integers greater than or equal to 2. (Contributed by Paul Chapman, 26-Oct-2012)

Ref Expression
Assertion uz2mulcl ⊢ M ∈ ℤ ≥ 2 ∧ N ∈ ℤ ≥ 2 → M ⋅ N ∈ ℤ ≥ 2

Proof

Step Hyp Ref Expression
1 eluzelz ⊢ M ∈ ℤ ≥ 2 → M ∈ ℤ
2 eluzelz ⊢ N ∈ ℤ ≥ 2 → N ∈ ℤ
3 zmulcl ⊢ M ∈ ℤ ∧ N ∈ ℤ → M ⋅ N ∈ ℤ
4 1 2 3 syl2an ⊢ M ∈ ℤ ≥ 2 ∧ N ∈ ℤ ≥ 2 → M ⋅ N ∈ ℤ
5 eluz2b1 ⊢ M ∈ ℤ ≥ 2 ↔ M ∈ ℤ ∧ 1 < M
6 zre ⊢ M ∈ ℤ → M ∈ ℝ
7 6 anim1i ⊢ M ∈ ℤ ∧ 1 < M → M ∈ ℝ ∧ 1 < M
8 5 7 sylbi ⊢ M ∈ ℤ ≥ 2 → M ∈ ℝ ∧ 1 < M
9 eluz2b1 ⊢ N ∈ ℤ ≥ 2 ↔ N ∈ ℤ ∧ 1 < N
10 zre ⊢ N ∈ ℤ → N ∈ ℝ
11 10 anim1i ⊢ N ∈ ℤ ∧ 1 < N → N ∈ ℝ ∧ 1 < N
12 9 11 sylbi ⊢ N ∈ ℤ ≥ 2 → N ∈ ℝ ∧ 1 < N
13 mulgt1 ⊢ M ∈ ℝ ∧ N ∈ ℝ ∧ 1 < M ∧ 1 < N → 1 < M ⋅ N
14 13 an4s ⊢ M ∈ ℝ ∧ 1 < M ∧ N ∈ ℝ ∧ 1 < N → 1 < M ⋅ N
15 8 12 14 syl2an ⊢ M ∈ ℤ ≥ 2 ∧ N ∈ ℤ ≥ 2 → 1 < M ⋅ N
16 eluz2b1 ⊢ M ⋅ N ∈ ℤ ≥ 2 ↔ M ⋅ N ∈ ℤ ∧ 1 < M ⋅ N
17 4 15 16 sylanbrc ⊢ M ∈ ℤ ≥ 2 ∧ N ∈ ℤ ≥ 2 → M ⋅ N ∈ ℤ ≥ 2