Metamath Proof Explorer


Theorem mulmod0

Description: The product of an integer and a positive real number is 0 modulo the positive real number. (Contributed by Alexander van der Vekens, 17-May-2018) (Revised by AV, 5-Jul-2020)

Ref Expression
Assertion mulmod0 ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M mod M = 0

Proof

Step Hyp Ref Expression
1 zcn ⊢ A ∈ ℤ → A ∈ ℂ
2 1 adantr ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ∈ ℂ
3 rpcn ⊢ M ∈ ℝ + → M ∈ ℂ
4 3 adantl ⊢ A ∈ ℤ ∧ M ∈ ℝ + → M ∈ ℂ
5 rpne0 ⊢ M ∈ ℝ + → M ≠ 0
6 5 adantl ⊢ A ∈ ℤ ∧ M ∈ ℝ + → M ≠ 0
7 2 4 6 divcan4d ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M M = A
8 simpl ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ∈ ℤ
9 7 8 eqeltrd ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M M ∈ ℤ
10 zre ⊢ A ∈ ℤ → A ∈ ℝ
11 rpre ⊢ M ∈ ℝ + → M ∈ ℝ
12 remulcl ⊢ A ∈ ℝ ∧ M ∈ ℝ → A ⋅ M ∈ ℝ
13 10 11 12 syl2an ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M ∈ ℝ
14 mod0 ⊢ A ⋅ M ∈ ℝ ∧ M ∈ ℝ + → A ⋅ M mod M = 0 ↔ A ⋅ M M ∈ ℤ
15 13 14 sylancom ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M mod M = 0 ↔ A ⋅ M M ∈ ℤ
16 9 15 mpbird ⊢ A ∈ ℤ ∧ M ∈ ℝ + → A ⋅ M mod M = 0