		Search-engine friendly clone of the ACL2 documentation.

Field-neg

Field-neg-correctness

Correctness of the circuit.

The equivalence between predicate and specification is proved automatically via the prime fields library rules.

The extension to the circuit is boilerplate.

Definitions and Theorems

Theorem: field-neg-pred-to-spec

(defthm field-neg-pred-to-spec
  (implies (and (primep prime)
                (pfield::fep x prime)
                (pfield::fep y prime))
           (equal (field-neg-pred x y prime)
                  (field-neg-spec x y prime))))

Theorem: field-neg-circuit-to-spec

(defthm field-neg-circuit-to-spec
  (implies (and (equal (pfcs::lookup-definition (pfname "field_neg")
                                                defs)
                       (field-neg-circuit))
                (primep prime)
                (pfield::fep x prime)
                (pfield::fep y prime))
           (equal (pfcs::definition-satp (pfname "field_neg")
                                         defs (list x y)
                                         prime)
                  (field-neg-spec x y prime))))