law le_shr

lawful-arrays@0.1.0.0 · proof_index.bend:66

import Base

66law le_shr:
67  for +n: U32
68  for +i: U32
69  for +p: Nat
70  for +hn: {U32.to_nat(n) == Nat.pow(2n, 1n+p) : Nat}
71  for +hz: {U32.is_lt(i, U32.shr(n)) == False{} : Bool}
72  {U32.is_le(U32.shr(n), i) == True{} : Bool}