Metamath Proof Explorer


Theorem fltoprmlem2

Description: Lemma 2 for fltoprm : If an integer greater than or equal to 3 is a power of 2, it is a multiple of 4. (Contributed by AV, 15-Sep-2026)

Ref Expression
Assertion fltoprmlem2 ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ ℕ 0 ∧ N = 2 K → 4 ∥ N

Proof

Step Hyp Ref Expression
1 eluz2 ⊢ N ∈ ℤ ≥ 3 ↔ 3 ∈ ℤ ∧ N ∈ ℤ ∧ 3 ≤ N
2 zlem1lt ⊢ 3 ∈ ℤ ∧ N ∈ ℤ → 3 ≤ N ↔ 3 − 1 < N
3 3m1e2 ⊢ 3 − 1 = 2
4 2cn ⊢ 2 ∈ ℂ
5 exp1 ⊢ 2 ∈ ℂ → 2 1 = 2
6 4 5 ax-mp ⊢ 2 1 = 2
7 3 6 eqtr4i ⊢ 3 − 1 = 2 1
8 7 breq1i ⊢ 3 − 1 < N ↔ 2 1 < N
9 2re ⊢ 2 ∈ ℝ
10 9 a1i ⊢ K ∈ ℕ 0 → 2 ∈ ℝ
11 1zzd ⊢ K ∈ ℕ 0 → 1 ∈ ℤ
12 nn0z ⊢ K ∈ ℕ 0 → K ∈ ℤ
13 1lt2 ⊢ 1 < 2
14 13 a1i ⊢ K ∈ ℕ 0 → 1 < 2
15 10 11 12 14 ltexp2d ⊢ K ∈ ℕ 0 → 1 < K ↔ 2 1 < 2 K
16 sq2 ⊢ 2 2 = 4
17 2z ⊢ 2 ∈ ℤ
18 2nn0 ⊢ 2 ∈ ℕ 0
19 17 a1i ⊢ K ∈ ℕ 0 ∧ 1 < K → 2 ∈ ℤ
20 12 adantr ⊢ K ∈ ℕ 0 ∧ 1 < K → K ∈ ℤ
21 df-2 ⊢ 2 = 1 + 1
22 11 12 zltp1led ⊢ K ∈ ℕ 0 → 1 < K ↔ 1 + 1 ≤ K
23 22 biimpa ⊢ K ∈ ℕ 0 ∧ 1 < K → 1 + 1 ≤ K
24 21 23 eqbrtrid ⊢ K ∈ ℕ 0 ∧ 1 < K → 2 ≤ K
25 eluz2 ⊢ K ∈ ℤ ≥ 2 ↔ 2 ∈ ℤ ∧ K ∈ ℤ ∧ 2 ≤ K
26 19 20 24 25 syl3anbrc ⊢ K ∈ ℕ 0 ∧ 1 < K → K ∈ ℤ ≥ 2
27 dvdsexp ⊢ 2 ∈ ℤ ∧ 2 ∈ ℕ 0 ∧ K ∈ ℤ ≥ 2 → 2 2 ∥ 2 K
28 17 18 26 27 mp3an12i ⊢ K ∈ ℕ 0 ∧ 1 < K → 2 2 ∥ 2 K
29 16 28 eqbrtrrid ⊢ K ∈ ℕ 0 ∧ 1 < K → 4 ∥ 2 K
30 29 ex ⊢ K ∈ ℕ 0 → 1 < K → 4 ∥ 2 K
31 15 30 sylbird ⊢ K ∈ ℕ 0 → 2 1 < 2 K → 4 ∥ 2 K
32 breq2 ⊢ N = 2 K → 2 1 < N ↔ 2 1 < 2 K
33 breq2 ⊢ N = 2 K → 4 ∥ N ↔ 4 ∥ 2 K
34 32 33 imbi12d ⊢ N = 2 K → 2 1 < N → 4 ∥ N ↔ 2 1 < 2 K → 4 ∥ 2 K
35 31 34 imbitrrid ⊢ N = 2 K → K ∈ ℕ 0 → 2 1 < N → 4 ∥ N
36 35 com13 ⊢ 2 1 < N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
37 36 a1i ⊢ N ∈ ℤ → 2 1 < N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
38 8 37 biimtrid ⊢ N ∈ ℤ → 3 − 1 < N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
39 38 adantl ⊢ 3 ∈ ℤ ∧ N ∈ ℤ → 3 − 1 < N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
40 2 39 sylbid ⊢ 3 ∈ ℤ ∧ N ∈ ℤ → 3 ≤ N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
41 40 3impia ⊢ 3 ∈ ℤ ∧ N ∈ ℤ ∧ 3 ≤ N → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
42 1 41 sylbi ⊢ N ∈ ℤ ≥ 3 → K ∈ ℕ 0 → N = 2 K → 4 ∥ N
43 42 3imp ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ ℕ 0 ∧ N = 2 K → 4 ∥ N