proposition: Lemma eqsl_underL s (i j : itv_bound A) : bnd (ix_bnd s i) (size s) = 0%N -> &=s (Interval i j) = &=s (Interval -oo j).
proof: Proof. by move=>H; apply: itv_underL. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval order) pcm(options prelude ordtype seqext slice useqord)