Theorems · Theorem · order theory
Order.Ideal.IsPrime.of_mem_or_mem
∀ {P : Type u_1} [inst : SemilatticeInf P] {I : Order.Ideal P} [I.IsProper],
(∀ {x y : P}, x ⊓ y ∈ I → x ∈ I ∨ y ∈ I) → I.IsPrime- Defined in
- Mathlib.Order.PrimeIdeal
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLike.coeproof · cited by 8,199
- Compl.complproof · cited by 2,925
- SemilatticeInfstatement and proof · cited by 634
- inf_le_leftproof · cited by 286
- inf_le_rightproof · cited by 238
- Order.Idealstatement and proof · cited by 102
- Order.Ideal.IsProperstatement and proof · cited by 23
- Order.Ideal.IsPrimestatement · cited by 11
- Set.nonempty_complproof · cited by 9
- Order.IsPFilter.of_defproof · cited by 2
- Order.Ideal.isProper_iffproof · cited by 1
- Order.Ideal.mem_compl_of_geproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Order.Ideal.isPrime_iff_mem_or_memproof · cited by 1