Theorems · Inductive type · commutative algebra
Ideal.IsPrime
{α : Type u} → [inst : Semiring α] → Ideal α → PropAn ideal P of a ring R is prime if P ≠ R and xy ∈ P → x ∈ P ∨ y ∈ P
- Defined in
- Mathlib.RingTheory.Ideal.Prime
- Cited by
- 827 results in Mathlib
- Foundations
- Depth 15 from the axioms, rests on 127 definitions · uses no axioms
- Assumes
- Semiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by940
Results whose statement or proof uses this declaration.
- Ideal.primeComplstatement and proof · cited by 462
- Localization.AtPrimestatement and proof · cited by 299
- Ideal.ResidueFieldstatement and proof · cited by 119
- Ideal.primesOverproof · cited by 84
- Ideal.IsPrime.ne_topstatement and proof · cited by 82
- IsLocalization.AtPrimestatement and proof · cited by 79
- Ideal.inertiaDegproof · cited by 60
- Ideal.ramificationIdxproof · cited by 59
- Localization.localRingHomstatement and proof · cited by 54
- Ideal.IsMaximal.isPrimestatement · cited by 53
- PrimeSpectrum.extproof · cited by 43
- Ideal.Fiberstatement and proof · cited by 40
Showing the 200 most cited of 940.