ProofBytes.put_bits: law of lawful-words@0.1.0.0
Import: import lawful-words@0.1.0.0/proof_bytes.bend as ProofBytes
Lines 377-384 of lawful-words@0.1.0.0/proof_bytes.bend: https://jend.leeeet.dev/read.txt?path=lawful-words@0.1.0.0/proof_bytes.bend&start_line=377&end_line=384

import Base

law put_bits:
  for +l: Bool
  for +i: Bool
  for +x: Bool
  for +y: Bool
  for imp1: {l == True{} : Bool} -> {i == True{} : Bool}
  for imp2: {l == False{} : Bool} -> {y == False{} : Bool}
  {Bool.and(l, Bool.or(Bool.and(x, Bool.and(i, Bool.not(Bool.and(i, l)))), Bool.and(i, y))) == y : Bool}

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.not
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.or
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=and_false_r