law bit_and

lawful-words@0.1.0.0 · proof_u32.bend:1263

import Base
import lawful-words@0.1.0.0/defs.bend as D

1263law bit_and:
1264  for +a: U32
1265  for +b: U32
1266  for +k: Nat
1267  {D.bit(U32.and(a, b), k) == (D.bit(a, k) && D.bit(b, k)) : Bool}