Theorems · Definition · order theory
Set.uIcc
{α : Type u_1} → [Lattice α] → α → α → Set αuIcc a b is the set of elements lying between a and b, with a and b included.
Note that we define it more generally in a lattice as Set.Icc (a ⊓ b) (a ⊔ b). In a product type,
uIcc corresponds to the bounding box of the two elements.
- Cited by
- 393 results in Mathlib
- Foundations
- Depth 4 from the axioms, rests on 27 definitions · uses no axioms
- Assumes
- Lattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by396
Results whose statement or proof uses this declaration.
- Set.uIcc_of_lestatement · cited by 54
- ContinuousOn.intervalIntegrablestatement and proof · cited by 27
- Set.ordConnectedComponentproof · cited by 23
- Set.uIcc_of_gestatement · cited by 22
- intervalIntegral.integral_congrstatement and proof · cited by 18
- Set.uIcc_commstatement · cited by 18
- Set.left_mem_uIccstatement · cited by 17
- isCompact_uIccstatement · cited by 17
- Set.uIoc_subset_uIccstatement · cited by 15
- AbsolutelyContinuousOnInterval.disjWithinproof · cited by 15
- Set.right_mem_uIccstatement · cited by 13
- Finset.coe_uIccstatement · cited by 13
Showing the 200 most cited of 396.