Theorems · Definition · order theory
Finset.Ioo
{α : Type u_1} → [inst : Preorder α] → [LocallyFiniteOrder α] → α → α → Finset αThe finset $(a, b)$ of elements x such that a < x and x < b. Basically Set.Ioo a b as a
finset.
- Defined in
- Mathlib.Order.Interval.Finset.Defs
- Cited by
- 185 results in Mathlib
- Foundations
- Depth 3 from the axioms, rests on 5 definitions · uses no axioms
- Assumes
- PreorderLocallyFiniteOrder
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
- Preorderstatement and proof · cited by 7,952
- LocallyFiniteOrderstatement and proof · cited by 658
- LocallyFiniteOrder.finsetIooproof · cited by 1
Cited by189
Results whose statement or proof uses this declaration.
- Finset.coe_Ioostatement · cited by 48
- Finset.mem_Ioostatement · cited by 13
- Multiset.Iooproof · cited by 13
- Nat.card_Ioostatement · cited by 7
- Finset.card_Ioo_eq_card_Icc_sub_twostatement · cited by 6
- Finset.left_notMem_Ioostatement and proof · cited by 6
- Finset.Ico_eq_cons_Ioostatement and proof · cited by 4
- Finset.right_notMem_Ioostatement and proof · cited by 4
- Commute.add_pow_prime_pow_eqstatement and proof · cited by 3
- Commute.add_pow_prime_pow_eq'statement and proof · cited by 3
- Finset.Ioo_eq_emptystatement and proof · cited by 3
- Finset.card_Ioo_eq_card_Ico_sub_onestatement and proof · cited by 3