Theorems · Inductive type · order theory
LocallyFiniteOrder
(α : Type u_1) → [Preorder α] → Type u_1
This is a mixin class describing a locally finite order,
that is, is an order where bounded intervals are finite.
When you don't care too much about definitional equality, you can use LocallyFiniteOrder.ofIcc or
LocallyFiniteOrder.ofFiniteIcc to build a locally finite order from just Finset.Icc.
- Defined in
- Mathlib.Order.Interval.Finset.Defs
- Cited by
- 658 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 2 definitions · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement · cited by 7,952
Cited by710
Results whose statement or proof uses this declaration.
- Finset.Icostatement and proof · cited by 450
- Finset.Iccstatement and proof · cited by 348
- Finset.Iocstatement and proof · cited by 301
- Finset.Ioostatement and proof · cited by 185
- Finset.uIccstatement and proof · cited by 84
- Finset.coe_Icostatement and proof · cited by 66
- Finset.coe_Iccstatement and proof · cited by 60
- Finset.coe_Iocstatement and proof · cited by 55
- Finset.mem_Icostatement and proof · cited by 50
- Finset.coe_Ioostatement and proof · cited by 48
- Finset.mem_Iccstatement and proof · cited by 39
- Multiset.Icostatement and proof · cited by 32
Showing the 200 most cited of 710.