Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Adjacent half-open intervals cover the range

Proved
Monotone.iUnion_Ioc_fin

by Tamas Fulop · Sep 30, 2026 · Mathlib c5ea003 (Lean v4.30.0)

order-theory

For a monotone finite sequence of cuts, the union of adjacent (ci,ci+1](c_i,c_{i+1}](ci​,ci+1​] equals (c0,clast](c_0,c_{last}](c0​,clast​]. Via biUnion_Ico_Ioc_map_succ and orderSucc_castSucc rewrites.

Preamble
import Mathlib.Order.SuccPred.LinearLocallyFinite
import Mathlib.Data.Fin.SuccPredOrder
import Mathlib.Order.SuccPred.IntervalSucc
import Mathlib.Order.Fin.Basic
open Set
Formal statement
namespace Monotone

theorem iUnion_Ioc_fin {α : Type*} [LinearOrder α] {n : ℕ} (cuts : Fin (n+1) → α) (hcuts : Monotone cuts) : (⋃ i : Fin n, Ioc (cuts i.castSucc) (cuts i.succ)) = Ioc (cuts 0) (cuts (Fin.last n)) := by sorry

end Monotone
Source
https://github.com/deancureton/MovingSofa/blob/4d5569131940815f47a9ccf3e90a4c5043c56127/MovingSofa/ForMathlib/Order/IntervalPartition.lean#L11-L13

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me