Metamath Proof Explorer


Theorem vfermltlALT

Description: Alternate proof of vfermltl , not using Euler's theorem. (Contributed by AV, 21-Aug-2020) (New usage is discouraged.) (Proof modification is discouraged.)

Ref Expression
Assertion vfermltlALT ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 mod P = 1

Proof

Step Hyp Ref Expression
1 2m1e1 ⊢ 2 − 1 = 1
2 1 a1i ⊢ P ∈ ℙ → 2 − 1 = 1
3 2 eqcomd ⊢ P ∈ ℙ → 1 = 2 − 1
4 3 oveq2d ⊢ P ∈ ℙ → P − 1 = P − 2 − 1
5 prmz ⊢ P ∈ ℙ → P ∈ ℤ
6 5 zcnd ⊢ P ∈ ℙ → P ∈ ℂ
7 2cnd ⊢ P ∈ ℙ → 2 ∈ ℂ
8 1cnd ⊢ P ∈ ℙ → 1 ∈ ℂ
9 6 7 8 subsubd ⊢ P ∈ ℙ → P − 2 − 1 = P - 2 + 1
10 4 9 eqtrd ⊢ P ∈ ℙ → P − 1 = P - 2 + 1
11 10 3ad2ant1 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → P − 1 = P - 2 + 1
12 11 oveq2d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 = A P - 2 + 1
13 zcn ⊢ A ∈ ℤ → A ∈ ℂ
14 13 3ad2ant2 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A ∈ ℂ
15 prmm2nn0 ⊢ P ∈ ℙ → P − 2 ∈ ℕ 0
16 15 3ad2ant1 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → P − 2 ∈ ℕ 0
17 14 16 expp1d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P - 2 + 1 = A P − 2 ⁢ A
18 12 17 eqtrd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 = A P − 2 ⁢ A
19 18 oveq1d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 mod P = A P − 2 ⁢ A mod P
20 15 anim1i ⊢ P ∈ ℙ ∧ A ∈ ℤ → P − 2 ∈ ℕ 0 ∧ A ∈ ℤ
21 20 ancomd ⊢ P ∈ ℙ ∧ A ∈ ℤ → A ∈ ℤ ∧ P − 2 ∈ ℕ 0
22 zexpcl ⊢ A ∈ ℤ ∧ P − 2 ∈ ℕ 0 → A P − 2 ∈ ℤ
23 21 22 syl ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 ∈ ℤ
24 23 zred ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 ∈ ℝ
25 24 3adant3 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 2 ∈ ℝ
26 simp2 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A ∈ ℤ
27 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
28 27 nnrpd ⊢ P ∈ ℙ → P ∈ ℝ +
29 28 3ad2ant1 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → P ∈ ℝ +
30 modmulmod ⊢ A P − 2 ∈ ℝ ∧ A ∈ ℤ ∧ P ∈ ℝ + → A P − 2 mod P ⁢ A mod P = A P − 2 ⁢ A mod P
31 25 26 29 30 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 2 mod P ⁢ A mod P = A P − 2 ⁢ A mod P
32 zre ⊢ A ∈ ℤ → A ∈ ℝ
33 32 adantl ⊢ P ∈ ℙ ∧ A ∈ ℤ → A ∈ ℝ
34 15 adantr ⊢ P ∈ ℙ ∧ A ∈ ℤ → P − 2 ∈ ℕ 0
35 33 34 reexpcld ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 ∈ ℝ
36 28 adantr ⊢ P ∈ ℙ ∧ A ∈ ℤ → P ∈ ℝ +
37 35 36 modcld ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 mod P ∈ ℝ
38 37 recnd ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 mod P ∈ ℂ
39 13 adantl ⊢ P ∈ ℙ ∧ A ∈ ℤ → A ∈ ℂ
40 38 39 mulcomd ⊢ P ∈ ℙ ∧ A ∈ ℤ → A P − 2 mod P ⁢ A = A ⁢ A P − 2 mod P
41 40 3adant3 ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 2 mod P ⁢ A = A ⁢ A P − 2 mod P
42 41 oveq1d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 2 mod P ⁢ A mod P = A ⁢ A P − 2 mod P mod P
43 19 31 42 3eqtr2d ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 mod P = A ⁢ A P − 2 mod P mod P
44 eqid ⊢ A P − 2 mod P = A P − 2 mod P
45 44 modprminv ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 2 mod P ∈ 1 … P − 1 ∧ A ⁢ A P − 2 mod P mod P = 1
46 45 simprd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A ⁢ A P − 2 mod P mod P = 1
47 43 46 eqtrd ⊢ P ∈ ℙ ∧ A ∈ ℤ ∧ ¬ P ∥ A → A P − 1 mod P = 1