law min_shift

lawful-bytes@0.1.1.0 · proof_fast_find.bend:275

import Base

275law min_shift:
276  for +s: Nat
277  for +r: Nat
278  for +tt: Nat
279  for +h: {Nat.is_le(s, tt) == True{} : Bool}
280  {Nat.min(Nat.add(s, r), tt) == Nat.add(s, Nat.min(r, Nat.sub(tt, s))) : Nat}