		Search-engine friendly clone of the ACL2 documentation.

Field-neg

Field-neg-lifting

Lifting of the circuit to a predicate.

Definitions and Theorems

Function: field-neg-pred

(defun field-neg-pred (x y prime)
  (and (equal (pfield::mul (pfield::neg x prime)
                           (mod 1 prime)
                           prime)
              y)))

Theorem: definition-satp-to-field-neg-pred

(defthm definition-satp-to-field-neg-pred
 (implies
  (and
    (equal
         (pfcs::lookup-definition '(:simple "field_neg")
                                  pfcs::defs)
         '(:definition
               (name :simple "field_neg")
               (pfcs::para (:simple "x") (:simple "y"))
               (pfcs::body (:equal (:mul (:neg (:var (:simple "x")))
                                         (:const 1))
                                   (:var (:simple "y"))))))
    (pfield::fep x prime)
    (pfield::fep y prime)
    (primep prime))
  (equal (pfcs::definition-satp '(:simple "field_neg")
                                pfcs::defs (list x y)
                                prime)
         (field-neg-pred x y prime))))