Theorems · Theorem · order theory
Order.Ideal.PrimePair.I_isProper
∀ {P : Type u_1} [inst : Preorder P] (IF : Order.Ideal.PrimePair P), IF.I.IsProper- Defined in
- Mathlib.Order.PrimeIdeal
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- SetLike.coeproof · cited by 8,199
- Preorderstatement and proof · cited by 7,952
- Order.Ideal.IsProperstatement · cited by 23
- Order.Ideal.PrimePairstatement and proof · cited by 12
- Order.Ideal.PrimePair.Fproof · cited by 9
- Order.Ideal.PrimePair.Istatement · cited by 9
- Order.PFilter.nonemptyproof · cited by 4
- Order.Ideal.isProper_of_notMemproof · cited by 2
- Order.Ideal.PrimePair.compl_I_eq_Fproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Order.Ideal.PrimePair.I_isPrimeproof · cited by 0