Theorem fpprbasnn 48312

Description: The base of a Fermat pseudoprime is a positive integer. (Contributed by AV, 30-May-2023.)

Assertion

Ref	Expression
fpprbasnn	⊢ (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ)

Proof of Theorem fpprbasnn

Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-1 6	. 2 ⊢ (𝑁 ∈ ℕ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
2		df-fppr 48308	. . . 4 ⊢ FPPr = (𝑛 ∈ ℕ ↦ {𝑥 ∈ (ℤ≥‘4) ∣ (𝑥 ∉ ℙ ∧ 𝑥 ∥ ((𝑛↑(𝑥 − 1)) − 1))})
3	2	fvmptndm 7002	. . 3 ⊢ (¬ 𝑁 ∈ ℕ → ( FPPr ‘𝑁) = ∅)
4		eleq2 2850	. . . 4 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) ↔ 𝑋 ∈ ∅))
5		noel 4288	. . . . 5 ⊢ ¬ 𝑋 ∈ ∅
6	5	pm2.21i 119	. . . 4 ⊢ (𝑋 ∈ ∅ → 𝑁 ∈ ℕ)
7	4, 6	biimtrdi 255	. . 3 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
8	3, 7	syl 17	. 2 ⊢ (¬ 𝑁 ∈ ℕ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
9	1, 8	pm2.61i 183	1 ⊢ (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1559   ∈ wcel 2141   ∉ wnel 3060  {crab 3413  ∅c0 4283   class class class wbr 5097  ‘cfv 6516  (class class class)co 7391  1c1 11068   − cmin 11408  ℕcn 12204  4c4 12268  ℤ_≥cuz 12833  ↑cexp 14068   ∥ cdvds 16277  ℙcprime 16696   FPPr cfppr 48307

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-dm 5653  df-iota 6472  df-fv 6524  df-fppr 48308

This theorem is referenced by:  fpprnn  48313  fpprwppr  48322  fpprwpprb  48323