Theorems · Definition · order theory
Order.Ideal.PrimePair.I
{P : Type u_2} → [inst : Preorder P] → Order.Ideal.PrimePair P → Order.Ideal P- Defined in
- Mathlib.Order.PrimeIdeal
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- Order.Idealstatement · cited by 102
- Order.Ideal.PrimePairstatement and proof · cited by 12
Cited by9
Results whose statement or proof uses this declaration.
- Order.Ideal.PrimePair.isCompl_I_Fstatement · cited by 5
- Order.Ideal.PrimePair.compl_I_eq_Fstatement · cited by 2
- Order.Ideal.PrimePair.I_isProperstatement · cited by 1
- Order.Ideal.PrimePair.compl_F_eq_Istatement · cited by 1
- Order.Ideal.PrimePair.F_isPrimeproof · cited by 0
- Order.Ideal.PrimePair.F_union_Istatement · cited by 0
- Order.Ideal.PrimePair.I_isPrimestatement and proof · cited by 0
- Order.Ideal.PrimePair.I_union_Fstatement · cited by 0
- Order.Ideal.PrimePair.disjointstatement · cited by 0