Metamath Proof Explorer


Theorem fltoprmlem1

Description: Lemma 1 for fltoprm : Every positive integer is either a power of 2 or has an odd prime factor. (Contributed by AV, 15-Sep-2026)

Ref Expression
Assertion fltoprmlem1 ⊢ N ∈ ℕ → ∃ p ∈ ℙ 2 < p ∧ p ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n

Proof

Step Hyp Ref Expression
1 oddprmdvds ⊢ N ∈ ℕ ∧ ¬ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ ∖ 2 p ∥ N
2 rexdifsn ⊢ ∃ p ∈ ℙ ∖ 2 p ∥ N ↔ ∃ p ∈ ℙ p ≠ 2 ∧ p ∥ N
3 simpr ⊢ N ∈ ℕ ∧ p ∈ ℙ → p ∈ ℙ
4 3 anim1i ⊢ N ∈ ℕ ∧ p ∈ ℙ ∧ p ≠ 2 → p ∈ ℙ ∧ p ≠ 2
5 eldifsn ⊢ p ∈ ℙ ∖ 2 ↔ p ∈ ℙ ∧ p ≠ 2
6 4 5 sylibr ⊢ N ∈ ℕ ∧ p ∈ ℙ ∧ p ≠ 2 → p ∈ ℙ ∖ 2
7 oddprmgt2 ⊢ p ∈ ℙ ∖ 2 → 2 < p
8 6 7 syl ⊢ N ∈ ℕ ∧ p ∈ ℙ ∧ p ≠ 2 → 2 < p
9 8 ex ⊢ N ∈ ℕ ∧ p ∈ ℙ → p ≠ 2 → 2 < p
10 9 anim1d ⊢ N ∈ ℕ ∧ p ∈ ℙ → p ≠ 2 ∧ p ∥ N → 2 < p ∧ p ∥ N
11 10 reximdva ⊢ N ∈ ℕ → ∃ p ∈ ℙ p ≠ 2 ∧ p ∥ N → ∃ p ∈ ℙ 2 < p ∧ p ∥ N
12 2 11 biimtrid ⊢ N ∈ ℕ → ∃ p ∈ ℙ ∖ 2 p ∥ N → ∃ p ∈ ℙ 2 < p ∧ p ∥ N
13 12 adantr ⊢ N ∈ ℕ ∧ ¬ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ ∖ 2 p ∥ N → ∃ p ∈ ℙ 2 < p ∧ p ∥ N
14 1 13 mpd ⊢ N ∈ ℕ ∧ ¬ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ 2 < p ∧ p ∥ N
15 14 orcd ⊢ N ∈ ℕ ∧ ¬ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ 2 < p ∧ p ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n
16 15 ex ⊢ N ∈ ℕ → ¬ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ 2 < p ∧ p ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n
17 olc ⊢ ∃ n ∈ ℕ 0 N = 2 n → ∃ p ∈ ℙ 2 < p ∧ p ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n
18 16 17 pm2.61d2 ⊢ N ∈ ℕ → ∃ p ∈ ℙ 2 < p ∧ p ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n