Theorems · Theorem · order theory
Finset.Ico_eq_cons_Ioo
∀ {α : Type u_2} [inst : PartialOrder α] [inst_1 : LocallyFiniteOrder α] {a b : α},
a < b → Finset.Ico a b = Finset.cons a (Finset.Ioo a b) ⋯Finset.cons version of Finset.Ioo_insert_left.
- Defined in
- Mathlib.Order.Interval.Finset.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- PartialOrderstatement and proof · cited by 6,410
- LocallyFiniteOrderstatement and proof · cited by 658
- Finset.Icostatement and proof · cited by 450
- Finset.consstatement · cited by 221
- Finset.Ioostatement and proof · cited by 185
- Finset.cons_eq_insertproof · cited by 59
- Finset.left_notMem_Ioostatement and proof · cited by 6
- Finset.Ioo_insert_leftproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- Commute.add_pow_prime_pow_eq'proof · cited by 3
- Finset.card_Ioo_eq_card_Ico_sub_oneproof · cited by 3
- Finset.add_sum_Ioo_eq_sum_Icoproof · cited by 1
- Finset.mul_prod_Ioo_eq_prod_Icoproof · cited by 1