Metamath Proof Explorer


Theorem nndivides2

Description: Definition of the divides relation for divisors greater than 1. (Contributed by AV, 5-Apr-2026)

Ref Expression
Assertion nndivides2 ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → M ∥ N ↔ ∃ n ∈ 2 ..^ N n ⋅ M = N

Proof

Step Hyp Ref Expression
1 elfzo2nn ⊢ M ∈ 2 ..^ N → M ∈ ℕ
2 nndivides ⊢ M ∈ ℕ ∧ N ∈ ℕ → M ∥ N ↔ ∃ n ∈ ℕ n ⋅ M = N
3 1 2 sylan ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → M ∥ N ↔ ∃ n ∈ ℕ n ⋅ M = N
4 oveq1 ⊢ n = m → n ⋅ M = m ⋅ M
5 4 eqeq1d ⊢ n = m → n ⋅ M = N ↔ m ⋅ M = N
6 5 cbvrexvw ⊢ ∃ n ∈ ℕ n ⋅ M = N ↔ ∃ m ∈ ℕ m ⋅ M = N
7 simplll ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → M ∈ 2 ..^ N
8 simpr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ → m ∈ ℕ
9 8 adantr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → m ∈ ℕ
10 1 adantr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → M ∈ ℕ
11 10 anim1i ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ → M ∈ ℕ ∧ m ∈ ℕ
12 11 adantr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → M ∈ ℕ ∧ m ∈ ℕ
13 nnmulcom ⊢ M ∈ ℕ ∧ m ∈ ℕ → M ⁢ m = m ⋅ M
14 12 13 syl ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → M ⁢ m = m ⋅ M
15 simpr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → m ⋅ M = N
16 14 15 eqtrd ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → M ⁢ m = N
17 nnmul2 ⊢ M ∈ 2 ..^ N ∧ m ∈ ℕ ∧ M ⁢ m = N → m ∈ 2 ..^ N
18 7 9 16 17 syl3anc ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → m ∈ 2 ..^ N
19 simpr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N ∧ m ∈ 2 ..^ N → m ∈ 2 ..^ N
20 5 adantl ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N ∧ m ∈ 2 ..^ N ∧ n = m → n ⋅ M = N ↔ m ⋅ M = N
21 15 adantr ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N ∧ m ∈ 2 ..^ N → m ⋅ M = N
22 19 20 21 rspcedvd ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N ∧ m ∈ 2 ..^ N → ∃ n ∈ 2 ..^ N n ⋅ M = N
23 18 22 mpdan ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ ∧ m ⋅ M = N → ∃ n ∈ 2 ..^ N n ⋅ M = N
24 23 ex ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ ∧ m ∈ ℕ → m ⋅ M = N → ∃ n ∈ 2 ..^ N n ⋅ M = N
25 24 rexlimdva ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → ∃ m ∈ ℕ m ⋅ M = N → ∃ n ∈ 2 ..^ N n ⋅ M = N
26 6 25 biimtrid ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → ∃ n ∈ ℕ n ⋅ M = N → ∃ n ∈ 2 ..^ N n ⋅ M = N
27 fzossnn ⊢ 1 ..^ N ⊆ ℕ
28 2eluzge1 ⊢ 2 ∈ ℤ ≥ 1
29 fzoss1 ⊢ 2 ∈ ℤ ≥ 1 → 2 ..^ N ⊆ 1 ..^ N
30 28 29 mp1i ⊢ 1 ..^ N ⊆ ℕ → 2 ..^ N ⊆ 1 ..^ N
31 id ⊢ 1 ..^ N ⊆ ℕ → 1 ..^ N ⊆ ℕ
32 30 31 sstrd ⊢ 1 ..^ N ⊆ ℕ → 2 ..^ N ⊆ ℕ
33 27 32 ax-mp ⊢ 2 ..^ N ⊆ ℕ
34 ssrexv ⊢ 2 ..^ N ⊆ ℕ → ∃ n ∈ 2 ..^ N n ⋅ M = N → ∃ n ∈ ℕ n ⋅ M = N
35 33 34 mp1i ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → ∃ n ∈ 2 ..^ N n ⋅ M = N → ∃ n ∈ ℕ n ⋅ M = N
36 26 35 impbid ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → ∃ n ∈ ℕ n ⋅ M = N ↔ ∃ n ∈ 2 ..^ N n ⋅ M = N
37 3 36 bitrd ⊢ M ∈ 2 ..^ N ∧ N ∈ ℕ → M ∥ N ↔ ∃ n ∈ 2 ..^ N n ⋅ M = N