law step_lt

lawful-bytes@0.1.1.0 · proof_find.bend:201

import Base

201# With j + 1 + k = to <= len, byte j is in range.
202law step_lt:
203  for +len: U32
204  for +j: U32
205  for +to: U32
206  for +k: Nat
207  for +hn: {Nat.add(U32.to_nat(j), 1n+k) == U32.to_nat(to) : Nat}
208  for +hto: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
209  {Nat.is_lt(U32.to_nat(j), U32.to_nat(len)) == True{} : Bool}