Metamath Proof Explorer


Theorem fmtnofac2

Description: Divisor of Fermat number (Euler's Result refined by François Édouard Anatole Lucas), see fmtnofac1 : Let F_n be a Fermat number. Let m be divisor of F_n. Then m is in the form: k*2^(n+2)+1 where k is a nonnegative integer. (Contributed by AV, 30-Jul-2021)

Ref Expression
Assertion fmtnofac2 ⊢ N ∈ ℤ ≥ 2 ∧ M ∈ ℕ ∧ M ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1

Proof

Step Hyp Ref Expression
1 breq1 ⊢ x = 1 → x ∥ FermatNo ⁡ N ↔ 1 ∥ FermatNo ⁡ N
2 1 anbi2d ⊢ x = 1 → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N ↔ N ∈ ℤ ≥ 2 ∧ 1 ∥ FermatNo ⁡ N
3 eqeq1 ⊢ x = 1 → x = k ⁢ 2 N + 2 + 1 ↔ 1 = k ⁢ 2 N + 2 + 1
4 3 rexbidv ⊢ x = 1 → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ ∃ k ∈ ℕ 0 1 = k ⁢ 2 N + 2 + 1
5 2 4 imbi12d ⊢ x = 1 → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ N ∈ ℤ ≥ 2 ∧ 1 ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 1 = k ⁢ 2 N + 2 + 1
6 breq1 ⊢ x = y → x ∥ FermatNo ⁡ N ↔ y ∥ FermatNo ⁡ N
7 6 anbi2d ⊢ x = y → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N ↔ N ∈ ℤ ≥ 2 ∧ y ∥ FermatNo ⁡ N
8 eqeq1 ⊢ x = y → x = k ⁢ 2 N + 2 + 1 ↔ y = k ⁢ 2 N + 2 + 1
9 8 rexbidv ⊢ x = y → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ ∃ k ∈ ℕ 0 y = k ⁢ 2 N + 2 + 1
10 7 9 imbi12d ⊢ x = y → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ N ∈ ℤ ≥ 2 ∧ y ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 y = k ⁢ 2 N + 2 + 1
11 breq1 ⊢ x = z → x ∥ FermatNo ⁡ N ↔ z ∥ FermatNo ⁡ N
12 11 anbi2d ⊢ x = z → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N ↔ N ∈ ℤ ≥ 2 ∧ z ∥ FermatNo ⁡ N
13 eqeq1 ⊢ x = z → x = k ⁢ 2 N + 2 + 1 ↔ z = k ⁢ 2 N + 2 + 1
14 13 rexbidv ⊢ x = z → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ ∃ k ∈ ℕ 0 z = k ⁢ 2 N + 2 + 1
15 12 14 imbi12d ⊢ x = z → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ N ∈ ℤ ≥ 2 ∧ z ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 z = k ⁢ 2 N + 2 + 1
16 breq1 ⊢ x = y ⁢ z → x ∥ FermatNo ⁡ N ↔ y ⁢ z ∥ FermatNo ⁡ N
17 16 anbi2d ⊢ x = y ⁢ z → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N ↔ N ∈ ℤ ≥ 2 ∧ y ⁢ z ∥ FermatNo ⁡ N
18 eqeq1 ⊢ x = y ⁢ z → x = k ⁢ 2 N + 2 + 1 ↔ y ⁢ z = k ⁢ 2 N + 2 + 1
19 18 rexbidv ⊢ x = y ⁢ z → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ ∃ k ∈ ℕ 0 y ⁢ z = k ⁢ 2 N + 2 + 1
20 17 19 imbi12d ⊢ x = y ⁢ z → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ N ∈ ℤ ≥ 2 ∧ y ⁢ z ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 y ⁢ z = k ⁢ 2 N + 2 + 1
21 breq1 ⊢ x = M → x ∥ FermatNo ⁡ N ↔ M ∥ FermatNo ⁡ N
22 21 anbi2d ⊢ x = M → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N ↔ N ∈ ℤ ≥ 2 ∧ M ∥ FermatNo ⁡ N
23 eqeq1 ⊢ x = M → x = k ⁢ 2 N + 2 + 1 ↔ M = k ⁢ 2 N + 2 + 1
24 23 rexbidv ⊢ x = M → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1
25 22 24 imbi12d ⊢ x = M → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1 ↔ N ∈ ℤ ≥ 2 ∧ M ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1
26 0nn0 ⊢ 0 ∈ ℕ 0
27 26 a1i ⊢ N ∈ ℤ ≥ 2 → 0 ∈ ℕ 0
28 oveq1 ⊢ k = 0 → k ⁢ 2 N + 2 = 0 ⋅ 2 N + 2
29 28 oveq1d ⊢ k = 0 → k ⁢ 2 N + 2 + 1 = 0 ⋅ 2 N + 2 + 1
30 29 eqeq2d ⊢ k = 0 → 1 = k ⁢ 2 N + 2 + 1 ↔ 1 = 0 ⋅ 2 N + 2 + 1
31 30 adantl ⊢ N ∈ ℤ ≥ 2 ∧ k = 0 → 1 = k ⁢ 2 N + 2 + 1 ↔ 1 = 0 ⋅ 2 N + 2 + 1
32 2nn0 ⊢ 2 ∈ ℕ 0
33 32 a1i ⊢ N ∈ ℤ ≥ 2 → 2 ∈ ℕ 0
34 eluzge2nn0 ⊢ N ∈ ℤ ≥ 2 → N ∈ ℕ 0
35 34 33 nn0addcld ⊢ N ∈ ℤ ≥ 2 → N + 2 ∈ ℕ 0
36 33 35 nn0expcld ⊢ N ∈ ℤ ≥ 2 → 2 N + 2 ∈ ℕ 0
37 36 nn0cnd ⊢ N ∈ ℤ ≥ 2 → 2 N + 2 ∈ ℂ
38 37 mul02d ⊢ N ∈ ℤ ≥ 2 → 0 ⋅ 2 N + 2 = 0
39 38 oveq1d ⊢ N ∈ ℤ ≥ 2 → 0 ⋅ 2 N + 2 + 1 = 0 + 1
40 0p1e1 ⊢ 0 + 1 = 1
41 39 40 eqtr2di ⊢ N ∈ ℤ ≥ 2 → 1 = 0 ⋅ 2 N + 2 + 1
42 27 31 41 rspcedvd ⊢ N ∈ ℤ ≥ 2 → ∃ k ∈ ℕ 0 1 = k ⁢ 2 N + 2 + 1
43 42 adantr ⊢ N ∈ ℤ ≥ 2 ∧ 1 ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 1 = k ⁢ 2 N + 2 + 1
44 simpl ⊢ N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → N ∈ ℤ ≥ 2
45 44 adantl ⊢ x ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → N ∈ ℤ ≥ 2
46 simpl ⊢ x ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → x ∈ ℙ
47 simprr ⊢ x ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → x ∥ FermatNo ⁡ N
48 nnssnn0 ⊢ ℕ ⊆ ℕ 0
49 fmtnoprmfac2 ⊢ N ∈ ℤ ≥ 2 ∧ x ∈ ℙ ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ x = k ⁢ 2 N + 2 + 1
50 ssrexv ⊢ ℕ ⊆ ℕ 0 → ∃ k ∈ ℕ x = k ⁢ 2 N + 2 + 1 → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1
51 48 49 50 mpsyl ⊢ N ∈ ℤ ≥ 2 ∧ x ∈ ℙ ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1
52 45 46 47 51 syl3anc ⊢ x ∈ ℙ ∧ N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1
53 52 ex ⊢ x ∈ ℙ → N ∈ ℤ ≥ 2 ∧ x ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 x = k ⁢ 2 N + 2 + 1
54 fmtnofac2lem ⊢ y ∈ ℤ ≥ 2 ∧ z ∈ ℤ ≥ 2 → N ∈ ℤ ≥ 2 ∧ y ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 y = k ⁢ 2 N + 2 + 1 ∧ N ∈ ℤ ≥ 2 ∧ z ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 z = k ⁢ 2 N + 2 + 1 → N ∈ ℤ ≥ 2 ∧ y ⁢ z ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 y ⁢ z = k ⁢ 2 N + 2 + 1
55 5 10 15 20 25 43 53 54 prmind ⊢ M ∈ ℕ → N ∈ ℤ ≥ 2 ∧ M ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1
56 55 expd ⊢ M ∈ ℕ → N ∈ ℤ ≥ 2 → M ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1
57 56 3imp21 ⊢ N ∈ ℤ ≥ 2 ∧ M ∈ ℕ ∧ M ∥ FermatNo ⁡ N → ∃ k ∈ ℕ 0 M = k ⁢ 2 N + 2 + 1