def nt.le_add_r
import bend-osdev-u32@0.1.0.0/PROOF_order.bend as PROOFOrderimport Base
457def nt.le_add_r(x: Nat, +w: Nat) -> {Nat.is_le(x, Nat.add(x, w)) == True{} : Bool}:
458 match x:
459 case 0n:
460 match w:
461 case 0n:
462 {==}
463 case 1n+wp:
464 {==}
465 case 1n+xp:
466 nt.le_add_r(xp, w)