Theorems · Theorem · order theory
Ioc_subset_biUnion_Ioc
∀ {X : Type u_1} [inst : LinearOrder X] (N : ℕ) (a : ℕ → X),
Set.Ioc (a 0) (a N) ⊆ ⋃ i ∈ Finset.range N, Set.Ioc (a i) (a (i + 1))Union of consecutive intervals contains the interval defined by the initial and final points.
- Defined in
- Mathlib.Order.Interval.Set.Union
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement · cited by 13,712
- LinearOrderstatement and proof · cited by 8,572
- Set.iUnionstatement and proof · cited by 2,483
- Finset.rangestatement and proof · cited by 1,341
- Set.Iocstatement and proof · cited by 971
- Set.iUnion_congr_Propproof · cited by 374
- Set.iUnion_emptyproof · cited by 68
- Set.iUnion_of_emptyproof · cited by 68
- Set.Ioc_eq_emptyproof · cited by 38
- Finset.range_add_oneproof · cited by 23
- Set.union_subset_union_rightproof · cited by 19
Cited by1
Results whose statement or proof uses this declaration.
- RealRMK.range_cut_partitionproof · cited by 0