def le_step
import bend-osdev-acpi@0.1.1.0/PROOF.bend as PROOFimport Base
2505def le_step(+a: Nat, +b: Nat, +e: {Nat.is_le(a, b) == True{} : Bool}) -> {Nat.is_le(a, 1n+b) == True{} : Bool}:
2506 match a b:
2507 case 0n _:
2508 {==}
2509 case 1n+ap 0n:
2510 Empty.absurd({Nat.is_le(1n+ap, 1n+0n) == True{} : Bool}, ft_absurd(e))
2511 case 1n+ap 1n+bp:
2512 le_step(ap, bp, e)