• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
    • Ipasir
    • Aignet
    • Aig
    • Satlink
    • Truth
    • Ubdds
      • Equal-by-eval-bdds
      • Ubdd-constructors
        • Q-and
        • Q-ite
        • Q-or
        • Q-implies
        • Q-iff
        • Q-and-c2
        • Q-and-c1
        • Q-or-c2
        • Q-not
        • Q-ite-fn
        • Q-xor
        • Q-and-is-nil
        • Cheap-and-expensive-arguments
        • Q-compose-list
        • Q-compose
        • Qv
        • Q-and-is-nilc2
        • Q-nor
        • Q-nand
      • Eval-bdd
      • Ubddp
      • Ubdd-fix
      • Q-sat
      • Bdd-sat-dfs
      • Eval-bdd-list
      • Qcdr
      • Qcar
      • Q-sat-any
      • Canonicalize-to-q-ite
      • Ubdd-listp
      • Qcons
    • Bdd
    • Faig
    • Bed
    • 4v
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Testing-utilities
  • Math

• Ubdd-constructors

Q-and-is-nilc2

(q-and-is-nilc2 x y) determines whether (q-and x (q-not y)) is always false.

This is like q-and-is-nil.

Definitions and Theorems

Function: q-and-is-nilc2

(defun q-and-is-nilc2 (x y)
       (declare (xargs :guard t))
       (cond ((eq x t) (eq y t))
             ((atom x) t)
             ((eq y t) t)
             ((atom y) nil)
             (t (and (q-and-is-nilc2 (qcar x) (qcar y))
                     (q-and-is-nilc2 (qcdr x) (qcdr y))))))

Theorem: q-and-is-nilc2-removal

(defthm q-and-is-nilc2-removal
        (implies (and (force (ubddp x))
                      (force (ubddp y)))
                 (equal (q-and-is-nilc2 x y)
                        (not (q-and x (q-not y))))))