def lt_asym
bendtorch-core@0.1.0.0 · src/autograd/reduce_replayed_proof.bend:172
import bendtorch-core@0.1.0.0/src/autograd/reduce_replayed_proof.bend as ReduceReplayedProof
import Base
import bendtorch-core@0.1.0.0/src/storage/arith.bend as Arith
172def lt_asym(+k: Nat, +b: Nat, h: {Nat.is_lt(k, b) == True{} : Bool}) -> {Nat.is_lt(b, k) == False{} : Bool}:
173 match k b:
174 case 0n 0n:
175 {==}
176 case 0n 1n+q:
177 {==}
178 case 1n+p 0n:
179 Empty.absurd({Nat.is_lt(0n, 1n+p) == False{} : Bool}, Arith.clash(h))
180 case 1n+p 1n+q:
181 lt_asym(p, q, h)