Metamath Proof Explorer


Theorem nfermltlrev

Description: Fermat's little theorem reversed is not generally true: There are integers a and p so that " p is prime" does not follow from a ^ p == a (mod p ). (Contributed by AV, 3-Jun-2023)

Ref Expression
Assertion nfermltlrev ⊢ ∃ a ∈ ℤ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ

Proof

Step Hyp Ref Expression
1 8nn ⊢ 8 ∈ ℕ
2 1 elexi ⊢ 8 ∈ V
3 eleq1 ⊢ a = 8 → a ∈ ℤ ↔ 8 ∈ ℤ
4 oveq1 ⊢ a = 8 → a p = 8 p
5 4 oveq1d ⊢ a = 8 → a p mod p = 8 p mod p
6 oveq1 ⊢ a = 8 → a mod p = 8 mod p
7 5 6 eqeq12d ⊢ a = 8 → a p mod p = a mod p ↔ 8 p mod p = 8 mod p
8 7 imbi1d ⊢ a = 8 → a p mod p = a mod p → p ∈ ℙ ↔ 8 p mod p = 8 mod p → p ∈ ℙ
9 8 notbid ⊢ a = 8 → ¬ a p mod p = a mod p → p ∈ ℙ ↔ ¬ 8 p mod p = 8 mod p → p ∈ ℙ
10 9 rexbidv ⊢ a = 8 → ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ ↔ ∃ p ∈ ℤ ≥ 3 ¬ 8 p mod p = 8 mod p → p ∈ ℙ
11 3 10 anbi12d ⊢ a = 8 → a ∈ ℤ ∧ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ ↔ 8 ∈ ℤ ∧ ∃ p ∈ ℤ ≥ 3 ¬ 8 p mod p = 8 mod p → p ∈ ℙ
12 1 nnzi ⊢ 8 ∈ ℤ
13 nfermltl8rev ⊢ ∃ p ∈ ℤ ≥ 3 ¬ 8 p mod p = 8 mod p → p ∈ ℙ
14 12 13 pm3.2i ⊢ 8 ∈ ℤ ∧ ∃ p ∈ ℤ ≥ 3 ¬ 8 p mod p = 8 mod p → p ∈ ℙ
15 2 11 14 ceqsexv2d ⊢ ∃ a a ∈ ℤ ∧ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ
16 df-rex ⊢ ∃ a ∈ ℤ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ ↔ ∃ a a ∈ ℤ ∧ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ
17 15 16 mpbir ⊢ ∃ a ∈ ℤ ∃ p ∈ ℤ ≥ 3 ¬ a p mod p = a mod p → p ∈ ℙ