Theorem fpprbasnn 47975

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 47971	. . . 4 ⊢ FPPr = (𝑛 ∈ ℕ ↦ {𝑥 ∈ (ℤ≥‘4) ∣ (𝑥 ∉ ℙ ∧ 𝑥 ∥ ((𝑛↑(𝑥 − 1)) − 1))})
3	2	fvmptndm 6972	. . 3 ⊢ (¬ 𝑁 ∈ ℕ → ( FPPr ‘𝑁) = ∅)
4		eleq2 2825	. . . 4 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) ↔ 𝑋 ∈ ∅))
5		noel 4290	. . . . 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 2113   ∉ wnel 3036  {crab 3399  ∅c0 4285   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  1c1 11027   − cmin 11364  ℕcn 12145  4c4 12202  ℤ_≥cuz 12751  ↑cexp 13984   ∥ cdvds 16179  ℙcprime 16598   FPPr cfppr 47970

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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-dm 5634  df-iota 6448  df-fv 6500  df-fppr 47971

This theorem is referenced by:  fpprnn  47976  fpprwppr  47985  fpprwpprb  47986