Theorems · Definition · order theory
Finset.uIcc
{α : Type u_1} → [inst : Lattice α] → [LocallyFiniteOrder α] → α → α → Finset αFinset.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 Finset.Icc (a ⊓ b) (a ⊔ b). In a
product type, Finset.uIcc corresponds to the bounding box of the two elements.
- Defined in
- Mathlib.Order.Interval.Finset.Defs
- Cited by
- 84 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
- Assumes
- LatticeLocallyFiniteOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Latticestatement and proof · cited by 916
- LocallyFiniteOrderstatement and proof · cited by 658
- Finset.Iccproof · cited by 348
Cited by84
Results whose statement or proof uses this declaration.
- Finset.coe_uIccstatement · cited by 13
- Finset.mem_uIccstatement · cited by 4
- Nat.card_uIccstatement · cited by 4
- Finset.uIcc_subset_uIccstatement and proof · cited by 3
- Finset.left_mem_uIccstatement · cited by 3
- Finset.right_mem_uIccstatement · cited by 2
- Fin.map_castAddEmb_uIccstatement · cited by 2
- Fin.map_castLEEmb_uIccstatement and proof · cited by 2
- PNat.card_uIccstatement and proof · cited by 1
- Multiset.uIcc_eqstatement · cited by 1
- Finset.eq_of_mem_uIcc_of_mem_uIccstatement · cited by 1
- DFinsupp.card_uIccstatement and proof · cited by 1