abbrev
definition
Prime
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 36.
browse module
All declarations in this module, on Recognition.
explainer page
used by
-
gamma_numerical_bounds -
BarrierCert -
beat_is_prime -
gapDiff_prime -
shimmer_cert -
ShimmerCert -
shimmer_is_gap45_arithmetic -
prime_unit_cost -
congruence_offsets_unique -
congruence_primes_are_three_smallest -
IsCongruenceEligible -
IsMockOrder -
mock_orders_complete -
no_cong_prime_between_3_5 -
no_cong_prime_between_5_7 -
no_cong_prime_between_7_11 -
mock_orders_are_complete -
mock_orders_are_odd_primes_lt_8 -
mock_orders_exactly_odd_primes_lt_8 -
odd_prime_lt_8_in_mock_orders -
prime_closes_iff_two -
one103_is_prime -
RamanujanPiCert -
nthPrime -
nthPrime_prime -
pairwise_coprime_nthPrime -
cost_twisted_certificate -
twistedCostSpectrumValue_pow -
twistedCostSpectrumValue_prime -
twistedPrimeCostSum -
twistedPrimeCostSum_one_char -
primeSupport_directed -
AllPrimeFactorsOneModThree -
GateHasPhaseSupport -
Primes -
eulerLedgerPartitionCert -
finitePrimeLedgerPartition -
finitePrimeLedgerPartition_insert_nonprime -
finitePrimeLedgerPartition_insert_prime -
finitePrimeLedgerPartition_primesBelow
formal source
33/-! ### Local aliases (optional convenience) -/
34
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