def internal_least_cons_le

bend-mathlib@0.8.1.0 · sort.bend:111

import Base
import bend-mathlib@0.8.1.0/list.bend as MList

111def internal_least_cons_le(~A: Data, ~le: A -> A -> Bool, +lo: A, +h: A, +t: List<&2, A>, hh: internal_least(~A, ~le, lo, h <> t)) -> {le(lo, h) == True{} : Bool}:
112  MList.internal_and_left(le(lo, h), internal_all_ge(~A, ~le, lo, t), hh)