def f_mul_a

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/fprot.bend:28

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/field.bend as F

28def f_mul_a(a: List<&2, Nat>, +b: List<&2, Nat>) -> {F.mul(a, b) == F.mul_b(a, b) : List<&2, Nat>}:
29  match a:
30    case Nil{}:
31      {==}
32    case x <> t:
33      {==}