def eq_f
bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/fwrap.bend:28
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/fwrap.bend as Fwrap
import Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/secp256k1/field.bend as FS
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/limbs.bend as L
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/field.bend as F
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/limbs.bend as LV
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/fprot.bend as FR
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/listops.bend as LO
28def eq_f(+one: Nat, +h1: {one == 1n : Nat}, +a: List<&2, Nat>, +b: List<&2, Nat>, +ha: {FS.limbs16(one, 16n, a) == True{} : Bool}, +hb: {FS.limbs16(one, 16n, b) == True{} : Bool}) -> {F.eq(a, b) == Nat.is_eq(FS.value(one, a), FS.value(one, b)) : Bool}:
29 %Equal.sym(Bool, F.eq(a, b), L.eq(a, b), FR.f_eq(a, b)) : {_ == Nat.is_eq(FS.value(one, a), FS.value(one, b)) : Bool}
30 %Equal.sym(Bool, L.eq(a, b), Nat.is_eq(LV.ev(a), LV.ev(b)), LO.eq_v(one, h1, a, b, ha, hb)) : {_ == Nat.is_eq(FS.value(one, a), FS.value(one, b)) : Bool}
31 %Equal.sym(Nat, FS.value(one, a), LV.ev(a), LV.ev_value(one, h1, a)) : {Nat.is_eq(LV.ev(a), LV.ev(b)) == Nat.is_eq(_, FS.value(one, b)) : Bool}
32 %Equal.sym(Nat, FS.value(one, b), LV.ev(b), LV.ev_value(one, h1, b)) : {Nat.is_eq(LV.ev(a), LV.ev(b)) == Nat.is_eq(LV.ev(a), _) : Bool}
33 {==}