Theorems · Definition · order theory
Order.Ideal.IsProper.casesOn
{P : Type u_1} →
[inst : LE P] →
{I : Order.Ideal P} →
{motive : I.IsProper → Sort u} → (t : I.IsProper) → ((ne_univ : ↑I ≠ Set.univ) → motive ⋯) → motive t- Defined in
- Mathlib.Order.Ideal
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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 and proof · cited by 8,199
- Set.univstatement and proof · cited by 3,945
- Order.Idealstatement and proof · cited by 102
- Order.Ideal.IsProperstatement and proof · cited by 23
Cited by1
Results whose statement or proof uses this declaration.
- Order.Ideal.isProper_iffproof · cited by 1