Theorem fpprbasnn 48376

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 48372	. . . 4 ⊢ FPPr = (𝑛 ∈ ℕ ↦ {𝑥 ∈ (ℤ≥‘4) ∣ (𝑥 ∉ ℙ ∧ 𝑥 ∥ ((𝑛↑(𝑥 − 1)) − 1))})
3	2	fvmptndm 7019	. . 3 ⊢ (¬ 𝑁 ∈ ℕ → ( FPPr ‘𝑁) = ∅)
4		eleq2 2858	. . . 4 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) ↔ 𝑋 ∈ ∅))
5		noel 4299	. . . . 5 ⊢ ¬ 𝑋 ∈ ∅
6	5	pm2.21i 120	. . . 4 ⊢ (𝑋 ∈ ∅ → 𝑁 ∈ ℕ)
7	4, 6	biimtrdi 256	. . 3 ⊢ (( FPPr ‘𝑁) = ∅ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
8	3, 7	syl 18	. 2 ⊢ (¬ 𝑁 ∈ ℕ → (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ))
9	1, 8	pm2.61i 184	1 ⊢ (𝑋 ∈ ( FPPr ‘𝑁) → 𝑁 ∈ ℕ)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149   ∉ wnel 3070  {crab 3423  ∅c0 4294   class class class wbr 5110  ‘cfv 6533  (class class class)co 7408  1c1 11097   − cmin 11437  ℕcn 12229  4c4 12293  ℤ_≥cuz 12858  ↑cexp 14093   ∥ cdvds 16306  ℙcprime 16725   FPPr cfppr 48371

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-dm 5669  df-iota 6489  df-fv 6541  df-fppr 48372

This theorem is referenced by:  fpprnn  48377  fpprwppr  48386  fpprwpprb  48387