def bq.le_rw
import bend-osdev-algo@0.1.0.0/proof_bsearch.bend as ProofBsearchimport Base
252def bq.le_rw(-x: Nat, -y: Nat, -x2: Nat, -y2: Nat, ex: {x == x2 : Nat}, ey: {y == y2 : Nat}, h: {Nat.is_le(x, y) == True{} : Bool}) -> {Nat.is_le(x2, y2) == True{} : Bool}:
253 %ex : {Nat.is_le(_, y2) == True{} : Bool}
254 %ey : {Nat.is_le(x, _) == True{} : Bool}
255 h