law hi_idx

lawful-arrays@0.1.0.0 · proof_index.bend:97

import Base

97law hi_idx:
98  for +n: U32
99  for +i: U32
100  for +p: Nat
101  for +hn: {U32.to_nat(n) == Nat.pow(2n, 1n+p) : Nat}
102  for +hi: {Nat.is_lt(U32.to_nat(i), Nat.pow(2n, 1n+p)) == True{} : Bool}
103  for +hz: {U32.is_lt(i, U32.shr(n)) == False{} : Bool}
104  {Nat.is_lt(U32.to_nat(U32.sub(i, U32.shr(n))), Nat.pow(2n, p)) == True{} : Bool}