Metamath Proof Explorer


Theorem fpprnn

Description: A Fermat pseudoprime to the base N is a positive integer. (Contributed by AV, 30-May-2023)

Ref Expression
Assertion fpprnn ⊢ X ∈ FPPr ⁡ N → X ∈ ℕ

Proof

Step Hyp Ref Expression
1 fpprbasnn ⊢ X ∈ FPPr ⁡ N → N ∈ ℕ
2 fpprel ⊢ N ∈ ℕ → X ∈ FPPr ⁡ N ↔ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ N X − 1 mod X = 1
3 eluz4nn ⊢ X ∈ ℤ ≥ 4 → X ∈ ℕ
4 3 3ad2ant1 ⊢ X ∈ ℤ ≥ 4 ∧ X ∉ ℙ ∧ N X − 1 mod X = 1 → X ∈ ℕ
5 2 4 biimtrdi ⊢ N ∈ ℕ → X ∈ FPPr ⁡ N → X ∈ ℕ
6 1 5 mpcom ⊢ X ∈ FPPr ⁡ N → X ∈ ℕ