Metamath Proof Explorer


Theorem fpprel2

Description: An alternate definition for a Fermat pseudoprime to the base 2. (Contributed by AV, 5-Jun-2023)

Ref Expression
Assertion fpprel2 ⊢ X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2

Proof

Step Hyp Ref Expression
1 2nn ⊢ 2 ∈ ℕ
2 fpprel ⊢ 2 ∈ ℕ → X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1
3 1 2 mp1i ⊢ X ∈ FPPr ⁡ 2 → X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1
4 uzuzle24 ⊢ X ∈ ℤ ≥ 4 → X ∈ ℤ ≥ 2
5 4 3ad2ant1 ⊢ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ ℤ ≥ 2
6 5 adantl ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ ℤ ≥ 2
7 fppr2odd ⊢ X ∈ FPPr ⁡ 2 → X ∈ Odd
8 7 adantr ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ Odd
9 simpr2 ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∉ ℙ
10 6 8 9 3jca ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ
11 fpprwppr ⊢ X ∈ FPPr ⁡ 2 → 2 X mod X = 2 mod X
12 2re ⊢ 2 ∈ ℝ
13 12 a1i ⊢ X ∈ ℤ ≥ 4 → 2 ∈ ℝ
14 eluz4nn ⊢ X ∈ ℤ ≥ 4 → X ∈ ℕ
15 14 nnrpd ⊢ X ∈ ℤ ≥ 4 → X ∈ ℝ +
16 0le2 ⊢ 0 ≤ 2
17 16 a1i ⊢ X ∈ ℤ ≥ 4 → 0 ≤ 2
18 eluz2 ⊢ X ∈ ℤ ≥ 4 ↔ 4 ∈ ℤ ∧ X ∈ ℤ ∧ 4 ≤ X
19 4z ⊢ 4 ∈ ℤ
20 zlem1lt ⊢ 4 ∈ ℤ ∧ X ∈ ℤ → 4 ≤ X ↔ 4 − 1 < X
21 19 20 mpan ⊢ X ∈ ℤ → 4 ≤ X ↔ 4 − 1 < X
22 4m1e3 ⊢ 4 − 1 = 3
23 22 breq1i ⊢ 4 − 1 < X ↔ 3 < X
24 12 a1i ⊢ X ∈ ℤ ∧ 3 < X → 2 ∈ ℝ
25 3re ⊢ 3 ∈ ℝ
26 25 a1i ⊢ X ∈ ℤ ∧ 3 < X → 3 ∈ ℝ
27 zre ⊢ X ∈ ℤ → X ∈ ℝ
28 27 adantr ⊢ X ∈ ℤ ∧ 3 < X → X ∈ ℝ
29 2lt3 ⊢ 2 < 3
30 29 a1i ⊢ X ∈ ℤ ∧ 3 < X → 2 < 3
31 simpr ⊢ X ∈ ℤ ∧ 3 < X → 3 < X
32 24 26 28 30 31 lttrd ⊢ X ∈ ℤ ∧ 3 < X → 2 < X
33 32 ex ⊢ X ∈ ℤ → 3 < X → 2 < X
34 23 33 biimtrid ⊢ X ∈ ℤ → 4 − 1 < X → 2 < X
35 21 34 sylbid ⊢ X ∈ ℤ → 4 ≤ X → 2 < X
36 35 a1i ⊢ 4 ∈ ℤ → X ∈ ℤ → 4 ≤ X → 2 < X
37 36 3imp ⊢ 4 ∈ ℤ ∧ X ∈ ℤ ∧ 4 ≤ X → 2 < X
38 18 37 sylbi ⊢ X ∈ ℤ ≥ 4 → 2 < X
39 modid ⊢ 2 ∈ ℝ ∧ X ∈ ℝ + ∧ 0 ≤ 2 ∧ 2 < X → 2 mod X = 2
40 13 15 17 38 39 syl22anc ⊢ X ∈ ℤ ≥ 4 → 2 mod X = 2
41 40 3ad2ant1 ⊢ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → 2 mod X = 2
42 11 41 sylan9eq ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → 2 X mod X = 2
43 10 42 jca ⊢ X ∈ FPPr ⁡ 2 ∧ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2
44 43 ex ⊢ X ∈ FPPr ⁡ 2 → X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 X − 1 mod X = 1 → X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2
45 3 44 sylbid ⊢ X ∈ FPPr ⁡ 2 → X ∈ FPPr ⁡ 2 → X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2
46 45 pm2.43i ⊢ X ∈ FPPr ⁡ 2 → X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2
47 ge2nprmge4 ⊢ X ∈ ℤ ≥ 2 ∧ X ∉ ℙ → X ∈ ℤ ≥ 4
48 47 3adant2 ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → X ∈ ℤ ≥ 4
49 simp3 ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → X ∉ ℙ
50 48 49 jca ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → X ∈ ℤ ≥ 4 ∧ X ∉ ℙ
51 50 adantr ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → X ∈ ℤ ≥ 4 ∧ X ∉ ℙ
52 1 a1i ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → 2 ∈ ℕ
53 12 a1i ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 2 ∈ ℝ
54 eluz2nn ⊢ X ∈ ℤ ≥ 2 → X ∈ ℕ
55 54 nnrpd ⊢ X ∈ ℤ ≥ 2 → X ∈ ℝ +
56 55 3ad2ant1 ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → X ∈ ℝ +
57 16 a1i ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 0 ≤ 2
58 48 38 syl ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 2 < X
59 53 56 57 58 39 syl22anc ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 2 mod X = 2
60 59 eqcomd ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 2 = 2 mod X
61 60 eqeq2d ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → 2 X mod X = 2 ↔ 2 X mod X = 2 mod X
62 61 biimpa ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → 2 X mod X = 2 mod X
63 52 62 jca ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → 2 ∈ ℕ ∧ 2 X mod X = 2 mod X
64 gcd2odd1 ⊢ X ∈ Odd → X gcd 2 = 1
65 64 3ad2ant2 ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ → X gcd 2 = 1
66 65 adantr ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → X gcd 2 = 1
67 fpprwpprb ⊢ X gcd 2 = 1 → X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 ∈ ℕ ∧ 2 X mod X = 2 mod X
68 66 67 syl ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ 2 ∈ ℕ ∧ 2 X mod X = 2 mod X
69 51 63 68 mpbir2and ⊢ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2 → X ∈ FPPr ⁡ 2
70 46 69 impbii ⊢ X ∈ FPPr ⁡ 2 ↔ X ∈ ℤ ≥ 2 ∧ X ∈ Odd ∧ X ∉ ℙ ∧ 2 X mod X = 2