def lt_succ_right

bendtorch-core@0.1.0.0 · src/autograd/reduce_fiber_proof.bend:313

import Base
import bendtorch-core@0.1.0.0/src/storage/arith.bend as Arith

313def lt_succ_right(+b: Nat, +k: Nat, h: {Nat.is_lt(b, k) == True{} : Bool}) -> {Nat.is_lt(b, 1n+k) == True{} : Bool}:
314  match b k:
315    case 0n k:
316      {==}
317    case 1n+p 0n:
318      Empty.absurd({Nat.is_lt(1n+p, 1n) == True{} : Bool}, Arith.clash(h))
319    case 1n+p 1n+q:
320      lt_succ_right(p, q, h)