Theorems · Theorem · order theory
DistribLattice.prime_ideal_of_disjoint_filter_ideal
∀ {α : Type u_1} [inst : DistribLattice α] {F : Order.PFilter α} {I : Order.Ideal α},
Disjoint ↑F ↑I → ∃ J, J.IsPrime ∧ I ≤ J ∧ Disjoint ↑F ↑J- Defined in
- Mathlib.Order.PrimeSeparator
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DistribLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites42
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SetLike.coestatement and proof · cited by 8,199
- Set.ofPredproof · cited by 6,101
- Set.Nonemptyproof · cited by 2,627
- Disjointstatement and proof · cited by 2,201
- le_reflproof · cited by 2,061
- le_transproof · cited by 985
- Set.sUnionproof · cited by 392
- le_sup_leftproof · cited by 265
- le_sup_rightproof · cited by 242
- Maximalproof · cited by 211
- IsChainproof · cited by 158
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.