fact: Definition closed_cell_side_limit_ok c := [&& left_pts c != [::], all (fun p => p.1 == (last dummy_pt (left_pts c)).1) (left_pts c), sorted >%R [seq p.2 | p <- left_pts c], head dummy_pt (left_pts c) === high c, last dummy_pt (left_pts c) === low c, right_pts c != [::], all (fun p => p.1 == (head dummy_pt (right_pts c)).1) (right_pts c), sorted <%R [seq p.2 | p <- right_pts c], head dummy_pt (right_pts c) === low c & last dummy_pt (right_pts c) === high c].
imports: mathcomp(all_ssreflect all_algebra all_real_closed reals) mathcomp.algebra_tactics(ring lra) casteljau convex counterclockwise intersection