def lt_succ_right

bendtorch-core@0.1.0.0 · src/autograd/reduce_replayed_proof.bend:151

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

151def lt_succ_right(+b: Nat, +k: Nat, h: {Nat.is_lt(b, k) == True{} : Bool}) -> {Nat.is_lt(b, 1n+k) == True{} : Bool}:
152  match b k:
153    case 0n _:
154      {==}
155    case 1n+p 0n:
156      Empty.absurd({Nat.is_lt(1n+p, 1n) == True{} : Bool}, Arith.clash(h))
157    case 1n+p 1n+q:
158      lt_succ_right(p, q, h)