Theorem fpprbasnn 47760

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 47756	. . . 4 ⊢ FPPr = (𝑛 ∈ ℕ ↦ {𝑥 ∈ (ℤ≥‘4) ∣ (𝑥 ∉ ℙ ∧ 𝑥 ∥ ((𝑛↑(𝑥 − 1)) − 1))})
3	2	fvmptndm 6955	. . 3 ⊢ (¬ 𝑁 ∈ ℕ → ( FPPr ‘𝑁) = ∅)
4		eleq2 2820	. . . 4 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) ↔ 𝑋 ∈ ∅))
5		noel 4283	. . . . 5 ⊢ ¬ 𝑋 ∈ ∅
6	5	pm2.21i 119	. . . 4 ⊢ (𝑋 ∈ ∅ → 𝑁 ∈ ℕ)
7	4, 6	biimtrdi 253	. . 3 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
8	3, 7	syl 17	. 2 ⊢ (¬ 𝑁 ∈ ℕ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
9	1, 8	pm2.61i 182	1 ⊢ (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111   ∉ wnel 3032  {crab 3395  ∅c0 4278   class class class wbr 5086  ‘cfv 6476  (class class class)co 7341  1c1 11002   − cmin 11339  ℕcn 12120  4c4 12177  ℤ_≥cuz 12727  ↑cexp 13963   ∥ cdvds 16158  ℙcprime 16577   FPPr cfppr 47755

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-mpt 5168  df-dm 5621  df-iota 6432  df-fv 6484  df-fppr 47756

This theorem is referenced by:  fpprnn  47761  fpprwppr  47770  fpprwpprb  47771