def internal_sorted_short

bend-mathlib@0.8.1.0 · sort.bend:182

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

182def internal_sorted_short(~A: Data, ~le: A -> A -> Bool, +xs: List<&2, A>, h: MNat.le(List.length(&2, A, xs), 1n)) -> MList.sorted_by(~A, ~le, xs):
183  match xs:
184    case Nil{}:
185      {==}
186    case +x <> +t:
187      match t:
188        case Nil{}:
189          internal_sorted_single(~A, ~le, x)
190        case +y <> +u:
191          %Equal.sym(List<&2, A>, t, Nil{}, internal_length_zero(~A, t, MNat.le_zero_eq(List.length(&2, A, t), MNat.le_of_succ_le_succ(List.length(&2, A, t), 0n, h)))) : {MList.sorted_by(~A, ~le, x <> _) : Data}
192          internal_sorted_single(~A, ~le, x)