law mul4s
import lawful-bytes@0.1.1.0/proof_fast_find.bend as ProofFastFindimport Base
341law mul4s:
342 for +w: Nat
343 {Nat.mul(Nat.add(w, 1n), 4n) == Nat.add(Nat.mul(w, 4n), 4n) : Nat}
import lawful-bytes@0.1.1.0/proof_fast_find.bend as ProofFastFindimport Base
341law mul4s:
342 for +w: Nat
343 {Nat.mul(Nat.add(w, 1n), 4n) == Nat.add(Nat.mul(w, 4n), 4n) : Nat}