def min_le_l

bend-collections-laws-math@1.0.0.0 · proofs/math/typed/natcmp.bend:115

import Base

115def min_le_l(+a: Nat, +b: Nat) -> {Nat.is_le(Nat.min(a, b), a) == True{} : Bool}:
116  match a b:
117    case 0n _:
118      {==}
119    case 1n+ +ap 0n:
120      {==}
121    case 1n+ +ap 1n+ +bp:
122      min_le_l(ap, bp)