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 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 8nn | |
|
2 | 1 | elexi | |
3 | eleq1 | |
|
4 | oveq1 | |
|
5 | 4 | oveq1d | |
6 | oveq1 | |
|
7 | 5 6 | eqeq12d | |
8 | 7 | imbi1d | |
9 | 8 | notbid | |
10 | 9 | rexbidv | |
11 | 3 10 | anbi12d | |
12 | 1 | nnzi | |
13 | nfermltl8rev | |
|
14 | 12 13 | pm3.2i | |
15 | 2 11 14 | ceqsexv2d | |
16 | df-rex | |
|
17 | 15 16 | mpbir | |