def lt_succ_le

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/nat.bend:116

import Base

116def lt_succ_le(+a: Nat, +b: Nat, e: {Nat.is_lt(a, 1n+b) == True{} : Bool}) -> {Nat.is_le(a, b) == True{} : Bool}:
117  match a b:
118    case 0n _:
119      zero_le(b)
120    case 1n+p 0n:
121      Empty.absurd({Nat.is_le(1n+p, 0n) == True{} : Bool}, lt_zero_absurd(p, e))
122    case 1n+p 1n+q:
123      lt_succ_le(p, q, e)