theorem
proved
prime_iff
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.NumberTheory.Primes.Basic on GitHub at line 38.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
bigOmega_prime -
bigOmega_prime_pow -
coprime_pow_of_prime_not_dvd -
coprime_prime_pow -
divisors_prime_pow -
liouville_prime -
liouville_prime_pow -
mobius_prime -
mobius_prime_sq -
omega_prime -
omega_prime_pow -
primeFactors_prime -
primeFactors_prime_pow -
radical_prime' -
sigma_one_prime -
sigma_prime -
sigma_zero_prime -
sigma_zero_prime_pow -
totient_prime -
totient_prime_pow -
vonMangoldt_prime -
vonMangoldt_prime_pow -
pow_dvd_iff_le_vp -
prime_dvd_iff_vp_pos -
vp_prime_ne -
vp_prime_pow -
vp_prime_pow_ne -
vp_prime_self -
prime_dvd_wheel840 -
squarefree_iff_vp_le_one_of_prime -
squarefree_prime -
squarefree_prime_dvd_iff_vp_eq_one -
coprime_iff_not_dvd_of_prime -
prime_dvd_iff_gcd_eq -
prime_dvd_of_dvd_pow -
prime_eq_of_dvd_pow
formal source
35/-- Repo-local alias for Mathlib’s `Nat.Prime` (kept transparent). -/
36abbrev Prime (n : ℕ) : Prop := Nat.Prime n
37
38@[simp] theorem prime_iff (n : ℕ) : Prime n ↔ Nat.Prime n := Iff.rfl
39
40end Primes
41end NumberTheory
42end IndisputableMonolith