Metamath Proof Explorer


Theorem fmtnoprmfac2

Description: Divisor of Fermat number (special form of Lucas' result, see fmtnofac2 ): Let F_n be a Fermat number. Let p be a prime divisor of F_n. Then p is in the form: k*2^(n+2)+1 where k is a positive integer. (Contributed by AV, 26-Jul-2021)

Ref Expression
Assertion fmtnoprmfac2 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1

Proof

Step Hyp Ref Expression
1 breq1 ⊢ P = 2 → P ∥ FermatNo ⁡ N ↔ 2 ∥ FermatNo ⁡ N
2 1 adantr ⊢ P = 2 ∧ N ∈ ℤ ≥ 2 → P ∥ FermatNo ⁡ N ↔ 2 ∥ FermatNo ⁡ N
3 eluzge2nn0 ⊢ N ∈ ℤ ≥ 2 → N ∈ ℕ 0
4 fmtnoodd ⊢ N ∈ ℕ 0 → ¬ 2 ∥ FermatNo ⁡ N
5 3 4 syl ⊢ N ∈ ℤ ≥ 2 → ¬ 2 ∥ FermatNo ⁡ N
6 5 adantl ⊢ P = 2 ∧ N ∈ ℤ ≥ 2 → ¬ 2 ∥ FermatNo ⁡ N
7 6 pm2.21d ⊢ P = 2 ∧ N ∈ ℤ ≥ 2 → 2 ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
8 2 7 sylbid ⊢ P = 2 ∧ N ∈ ℤ ≥ 2 → P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
9 8 a1d ⊢ P = 2 ∧ N ∈ ℤ ≥ 2 → P ∈ ℙ → P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
10 9 ex ⊢ P = 2 → N ∈ ℤ ≥ 2 → P ∈ ℙ → P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
11 10 3impd ⊢ P = 2 → N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
12 simpr1 ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → N ∈ ℤ ≥ 2
13 neqne ⊢ ¬ P = 2 → P ≠ 2
14 13 anim2i ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℙ ∧ P ≠ 2
15 eldifsn ⊢ P ∈ ℙ ∖ 2 ↔ P ∈ ℙ ∧ P ≠ 2
16 14 15 sylibr ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℙ ∖ 2
17 16 ex ⊢ P ∈ ℙ → ¬ P = 2 → P ∈ ℙ ∖ 2
18 17 3ad2ant2 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ¬ P = 2 → P ∈ ℙ ∖ 2
19 18 impcom ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∈ ℙ ∖ 2
20 simpr3 ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∥ FermatNo ⁡ N
21 fmtnoprmfac2lem1 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∖ 2 ∧ P ∥ FermatNo ⁡ N → 2 P − 1 2 mod P = 1
22 12 19 20 21 syl3anc ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → 2 P − 1 2 mod P = 1
23 simpl ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℙ
24 2nn ⊢ 2 ∈ ℕ
25 24 a1i ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 ∈ ℕ
26 oddprm ⊢ P ∈ ℙ ∖ 2 → P − 1 2 ∈ ℕ
27 16 26 syl ⊢ P ∈ ℙ ∧ ¬ P = 2 → P − 1 2 ∈ ℕ
28 27 nnnn0d ⊢ P ∈ ℙ ∧ ¬ P = 2 → P − 1 2 ∈ ℕ 0
29 25 28 nnexpcld ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 P − 1 2 ∈ ℕ
30 29 nnzd ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 P − 1 2 ∈ ℤ
31 23 30 jca ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℙ ∧ 2 P − 1 2 ∈ ℤ
32 31 ex ⊢ P ∈ ℙ → ¬ P = 2 → P ∈ ℙ ∧ 2 P − 1 2 ∈ ℤ
33 32 3ad2ant2 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ¬ P = 2 → P ∈ ℙ ∧ 2 P − 1 2 ∈ ℤ
34 33 impcom ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∈ ℙ ∧ 2 P − 1 2 ∈ ℤ
35 modprm1div ⊢ P ∈ ℙ ∧ 2 P − 1 2 ∈ ℤ → 2 P − 1 2 mod P = 1 ↔ P ∥ 2 P − 1 2 − 1
36 34 35 syl ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → 2 P − 1 2 mod P = 1 ↔ P ∥ 2 P − 1 2 − 1
37 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
38 37 adantr ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℕ
39 2z ⊢ 2 ∈ ℤ
40 39 a1i ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 ∈ ℤ
41 13 necomd ⊢ ¬ P = 2 → 2 ≠ P
42 41 adantl ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 ≠ P
43 2prm ⊢ 2 ∈ ℙ
44 43 a1i ⊢ ¬ P = 2 → 2 ∈ ℙ
45 44 anim2i ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℙ ∧ 2 ∈ ℙ
46 45 ancomd ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 ∈ ℙ ∧ P ∈ ℙ
47 prmrp ⊢ 2 ∈ ℙ ∧ P ∈ ℙ → 2 gcd P = 1 ↔ 2 ≠ P
48 46 47 syl ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 gcd P = 1 ↔ 2 ≠ P
49 42 48 mpbird ⊢ P ∈ ℙ ∧ ¬ P = 2 → 2 gcd P = 1
50 38 40 49 3jca ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1
51 50 28 jca ⊢ P ∈ ℙ ∧ ¬ P = 2 → P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1 ∧ P − 1 2 ∈ ℕ 0
52 51 ex ⊢ P ∈ ℙ → ¬ P = 2 → P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1 ∧ P − 1 2 ∈ ℕ 0
53 52 3ad2ant2 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ¬ P = 2 → P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1 ∧ P − 1 2 ∈ ℕ 0
54 53 impcom ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1 ∧ P − 1 2 ∈ ℕ 0
55 odzdvds ⊢ P ∈ ℕ ∧ 2 ∈ ℤ ∧ 2 gcd P = 1 ∧ P − 1 2 ∈ ℕ 0 → P ∥ 2 P − 1 2 − 1 ↔ odℤ ⁡ P ⁡ 2 ∥ P − 1 2
56 54 55 syl ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∥ 2 P − 1 2 − 1 ↔ odℤ ⁡ P ⁡ 2 ∥ P − 1 2
57 eluz2nn ⊢ N ∈ ℤ ≥ 2 → N ∈ ℕ
58 57 3ad2ant1 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → N ∈ ℕ
59 58 adantl ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → N ∈ ℕ
60 fmtnoprmfac1lem ⊢ N ∈ ℕ ∧ P ∈ ℙ ∖ 2 ∧ P ∥ FermatNo ⁡ N → odℤ ⁡ P ⁡ 2 = 2 N + 1
61 59 19 20 60 syl3anc ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → odℤ ⁡ P ⁡ 2 = 2 N + 1
62 breq1 ⊢ odℤ ⁡ P ⁡ 2 = 2 N + 1 → odℤ ⁡ P ⁡ 2 ∥ P − 1 2 ↔ 2 N + 1 ∥ P − 1 2
63 62 adantl ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N ∧ odℤ ⁡ P ⁡ 2 = 2 N + 1 → odℤ ⁡ P ⁡ 2 ∥ P − 1 2 ↔ 2 N + 1 ∥ P − 1 2
64 24 a1i ⊢ N ∈ ℤ ≥ 2 → 2 ∈ ℕ
65 peano2nn ⊢ N ∈ ℕ → N + 1 ∈ ℕ
66 57 65 syl ⊢ N ∈ ℤ ≥ 2 → N + 1 ∈ ℕ
67 66 nnnn0d ⊢ N ∈ ℤ ≥ 2 → N + 1 ∈ ℕ 0
68 64 67 nnexpcld ⊢ N ∈ ℤ ≥ 2 → 2 N + 1 ∈ ℕ
69 nndivides ⊢ 2 N + 1 ∈ ℕ ∧ P − 1 2 ∈ ℕ → 2 N + 1 ∥ P − 1 2 ↔ ∃ k ∈ ℕ k ⁢ 2 N + 1 = P − 1 2
70 68 27 69 syl2an ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ ¬ P = 2 → 2 N + 1 ∥ P − 1 2 ↔ ∃ k ∈ ℕ k ⁢ 2 N + 1 = P − 1 2
71 eqcom ⊢ k ⁢ 2 N + 1 = P − 1 2 ↔ P − 1 2 = k ⁢ 2 N + 1
72 71 a1i ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 = P − 1 2 ↔ P − 1 2 = k ⁢ 2 N + 1
73 37 nncnd ⊢ P ∈ ℙ → P ∈ ℂ
74 peano2cnm ⊢ P ∈ ℂ → P − 1 ∈ ℂ
75 73 74 syl ⊢ P ∈ ℙ → P − 1 ∈ ℂ
76 75 adantl ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ → P − 1 ∈ ℂ
77 76 adantr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P − 1 ∈ ℂ
78 simpr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ∈ ℕ
79 68 ad2antrr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 N + 1 ∈ ℕ
80 78 79 nnmulcld ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 ∈ ℕ
81 80 nncnd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 ∈ ℂ
82 2cnne0 ⊢ 2 ∈ ℂ ∧ 2 ≠ 0
83 82 a1i ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 ∈ ℂ ∧ 2 ≠ 0
84 divmul3 ⊢ P − 1 ∈ ℂ ∧ k ⁢ 2 N + 1 ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0 → P − 1 2 = k ⁢ 2 N + 1 ↔ P − 1 = k ⁢ 2 N + 1 ⋅ 2
85 77 81 83 84 syl3anc ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P − 1 2 = k ⁢ 2 N + 1 ↔ P − 1 = k ⁢ 2 N + 1 ⋅ 2
86 nncn ⊢ k ∈ ℕ → k ∈ ℂ
87 86 adantl ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ∈ ℂ
88 68 nncnd ⊢ N ∈ ℤ ≥ 2 → 2 N + 1 ∈ ℂ
89 88 ad2antrr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 N + 1 ∈ ℂ
90 2cnd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 ∈ ℂ
91 87 89 90 mulassd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 ⋅ 2 = k ⁢ 2 N + 1 ⋅ 2
92 2cnd ⊢ N ∈ ℕ → 2 ∈ ℂ
93 65 nnnn0d ⊢ N ∈ ℕ → N + 1 ∈ ℕ 0
94 92 93 expp1d ⊢ N ∈ ℕ → 2 N + 1 + 1 = 2 N + 1 ⋅ 2
95 nncn ⊢ N ∈ ℕ → N ∈ ℂ
96 add1p1 ⊢ N ∈ ℂ → N + 1 + 1 = N + 2
97 95 96 syl ⊢ N ∈ ℕ → N + 1 + 1 = N + 2
98 97 oveq2d ⊢ N ∈ ℕ → 2 N + 1 + 1 = 2 N + 2
99 94 98 eqtr3d ⊢ N ∈ ℕ → 2 N + 1 ⋅ 2 = 2 N + 2
100 57 99 syl ⊢ N ∈ ℤ ≥ 2 → 2 N + 1 ⋅ 2 = 2 N + 2
101 100 ad2antrr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 N + 1 ⋅ 2 = 2 N + 2
102 101 oveq2d ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 ⋅ 2 = k ⁢ 2 N + 2
103 91 102 eqtrd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 ⋅ 2 = k ⁢ 2 N + 2
104 103 eqeq2d ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P − 1 = k ⁢ 2 N + 1 ⋅ 2 ↔ P − 1 = k ⁢ 2 N + 2
105 73 adantl ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ → P ∈ ℂ
106 105 adantr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P ∈ ℂ
107 1cnd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 1 ∈ ℂ
108 id ⊢ N ∈ ℕ → N ∈ ℕ
109 24 a1i ⊢ N ∈ ℕ → 2 ∈ ℕ
110 108 109 nnaddcld ⊢ N ∈ ℕ → N + 2 ∈ ℕ
111 110 nnnn0d ⊢ N ∈ ℕ → N + 2 ∈ ℕ 0
112 57 111 syl ⊢ N ∈ ℤ ≥ 2 → N + 2 ∈ ℕ 0
113 64 112 nnexpcld ⊢ N ∈ ℤ ≥ 2 → 2 N + 2 ∈ ℕ
114 113 nncnd ⊢ N ∈ ℤ ≥ 2 → 2 N + 2 ∈ ℂ
115 114 ad2antrr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → 2 N + 2 ∈ ℂ
116 87 115 mulcld ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 2 ∈ ℂ
117 106 107 116 subadd2d ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P − 1 = k ⁢ 2 N + 2 ↔ k ⁢ 2 N + 2 + 1 = P
118 eqcom ⊢ k ⁢ 2 N + 2 + 1 = P ↔ P = k ⁢ 2 N + 2 + 1
119 118 a1i ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 2 + 1 = P ↔ P = k ⁢ 2 N + 2 + 1
120 104 117 119 3bitrd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → P − 1 = k ⁢ 2 N + 1 ⋅ 2 ↔ P = k ⁢ 2 N + 2 + 1
121 72 85 120 3bitrd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ k ∈ ℕ → k ⁢ 2 N + 1 = P − 1 2 ↔ P = k ⁢ 2 N + 2 + 1
122 121 rexbidva ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ → ∃ k ∈ ℕ k ⁢ 2 N + 1 = P − 1 2 ↔ ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
123 122 biimpd ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ → ∃ k ∈ ℕ k ⁢ 2 N + 1 = P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
124 123 adantrr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ ¬ P = 2 → ∃ k ∈ ℕ k ⁢ 2 N + 1 = P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
125 70 124 sylbid ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ ¬ P = 2 → 2 N + 1 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
126 125 expr ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ → ¬ P = 2 → 2 N + 1 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
127 126 3adant3 ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ¬ P = 2 → 2 N + 1 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
128 127 impcom ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → 2 N + 1 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
129 128 adantr ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N ∧ odℤ ⁡ P ⁡ 2 = 2 N + 1 → 2 N + 1 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
130 63 129 sylbid ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N ∧ odℤ ⁡ P ⁡ 2 = 2 N + 1 → odℤ ⁡ P ⁡ 2 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
131 130 ex ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → odℤ ⁡ P ⁡ 2 = 2 N + 1 → odℤ ⁡ P ⁡ 2 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
132 61 131 mpd ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → odℤ ⁡ P ⁡ 2 ∥ P − 1 2 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
133 56 132 sylbid ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → P ∥ 2 P − 1 2 − 1 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
134 36 133 sylbid ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → 2 P − 1 2 mod P = 1 → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
135 22 134 mpd ⊢ ¬ P = 2 ∧ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
136 135 ex ⊢ ¬ P = 2 → N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1
137 11 136 pm2.61i ⊢ N ∈ ℤ ≥ 2 ∧ P ∈ ℙ ∧ P ∥ FermatNo ⁡ N → ∃ k ∈ ℕ P = k ⁢ 2 N + 2 + 1