Metamath Proof Explorer


Theorem zdivgd

Description: Two ways to express " N is an integer multiple of M ". Originally a subproof of zdiv . (Contributed by SN, 25-Apr-2025)

Ref Expression
Hypotheses zdivgd.1 ⊢ φ → M ∈ ℂ
zdivgd.2 ⊢ φ → N ∈ ℂ
zdivgd.3 ⊢ φ → M ≠ 0
Assertion zdivgd ⊢ φ → ∃ k ∈ ℤ M ⁢ k = N ↔ N M ∈ ℤ

Proof

Step Hyp Ref Expression
1 zdivgd.1 ⊢ φ → M ∈ ℂ
2 zdivgd.2 ⊢ φ → N ∈ ℂ
3 zdivgd.3 ⊢ φ → M ≠ 0
4 zcn ⊢ k ∈ ℤ → k ∈ ℂ
5 4 adantl ⊢ φ ∧ k ∈ ℤ → k ∈ ℂ
6 1 adantr ⊢ φ ∧ k ∈ ℤ → M ∈ ℂ
7 3 adantr ⊢ φ ∧ k ∈ ℤ → M ≠ 0
8 5 6 7 divcan3d ⊢ φ ∧ k ∈ ℤ → M ⁢ k M = k
9 oveq1 ⊢ M ⁢ k = N → M ⁢ k M = N M
10 8 9 sylan9req ⊢ φ ∧ k ∈ ℤ ∧ M ⁢ k = N → k = N M
11 simplr ⊢ φ ∧ k ∈ ℤ ∧ M ⁢ k = N → k ∈ ℤ
12 10 11 eqeltrrd ⊢ φ ∧ k ∈ ℤ ∧ M ⁢ k = N → N M ∈ ℤ
13 12 rexlimdva2 ⊢ φ → ∃ k ∈ ℤ M ⁢ k = N → N M ∈ ℤ
14 2 1 3 divcan2d ⊢ φ → M ⁢ N M = N
15 oveq2 ⊢ k = N M → M ⁢ k = M ⁢ N M
16 15 eqeq1d ⊢ k = N M → M ⁢ k = N ↔ M ⁢ N M = N
17 16 rspcev ⊢ N M ∈ ℤ ∧ M ⁢ N M = N → ∃ k ∈ ℤ M ⁢ k = N
18 17 ex ⊢ N M ∈ ℤ → M ⁢ N M = N → ∃ k ∈ ℤ M ⁢ k = N
19 14 18 syl5com ⊢ φ → N M ∈ ℤ → ∃ k ∈ ℤ M ⁢ k = N
20 13 19 impbid ⊢ φ → ∃ k ∈ ℤ M ⁢ k = N ↔ N M ∈ ℤ