Theorems · Theorem · order theory
Order.Ideal.PrimePair.compl_I_eq_F
∀ {P : Type u_1} [inst : Preorder P] (IF : Order.Ideal.PrimePair P), (↑IF.I)ᶜ = ↑IF.F- Defined in
- Mathlib.Order.PrimeIdeal
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 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.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SetLike.coestatement · cited by 8,199
- Preorderstatement and proof · cited by 7,952
- Compl.complstatement · cited by 2,925
- Order.Idealstatement · cited by 102
- Order.PFilterstatement · cited by 32
- IsCompl.compl_eqproof · cited by 16
- Order.Ideal.PrimePairstatement and proof · cited by 12
- Order.Ideal.PrimePair.Fstatement · cited by 9
- Order.Ideal.PrimePair.Istatement · cited by 9
- Order.Ideal.PrimePair.isCompl_I_Fproof · cited by 5
Cited by2
Results whose statement or proof uses this declaration.
- Order.Ideal.PrimePair.I_isProperproof · cited by 1
- Order.Ideal.PrimePair.I_isPrimeproof · cited by 0