• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
      • Std/lists
        • Std/lists/abstract
        • Rev
        • Defsort
        • List-fix
        • Std/lists/nth
        • Hons-remove-duplicates
        • Std/lists/update-nth
        • Set-equiv
        • Duplicity
        • Prefixp
        • Std/lists/take
        • Std/lists/intersection$
        • Nats-equiv
        • Repeat
        • Index-of
        • All-equalp
        • Sublistp
        • Std/lists/nthcdr
        • Listpos
        • List-equiv
        • Final-cdr
        • Std/lists/append
        • Std/lists/remove
        • Subseq-list
        • Rcons
        • Std/lists/revappend
        • Std/lists/remove-duplicates-equal
        • Std/lists/reverse
        • Std/lists/last
        • Std/lists/resize-list
        • Flatten
        • Suffixp
        • Std/lists/butlast
        • Std/lists/set-difference
        • Std/lists/len
        • Std/lists/intersectp
          • Std/lists/true-listp
          • Intersectp-witness
          • Subsetp-witness
          • Std/lists/remove1-equal
          • Rest-n
          • First-n
          • Std/lists/union
          • Std/lists/add-to-set
          • Append-without-guard
          • Std/lists/subsetp
          • Std/lists/member
        • Std/alists
        • Obags
        • Std/util
        • Std/strings
        • Std/osets
        • Std/io
        • Std/basic
        • Std/system
        • Std/typed-lists
        • Std/bitsets
        • Std/testing
        • Std/typed-alists
        • Std/stobjs
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Std/lists
    • Intersectp

    Std/lists/intersectp

    Lemmas about intersectp available in the std/lists library.

    Definitions and Theorems

    Theorem: intersectp-equal-of-atom-left

    (defthm intersectp-equal-of-atom-left
      (implies (atom x)
               (equal (intersectp-equal x y) nil)))

    Theorem: intersectp-equal-of-atom-right

    (defthm intersectp-equal-of-atom-right
      (implies (atom y)
               (equal (intersectp-equal x y) nil)))

    Theorem: intersect-equal-of-cons-left

    (defthm intersect-equal-of-cons-left
      (equal (intersectp-equal (cons a x) y)
             (if (member-equal a y)
                 t
               (intersectp-equal x y))))

    Theorem: intersectp-equal-of-cons-right

    (defthm intersectp-equal-of-cons-right
      (equal (intersectp-equal x (cons a y))
             (if (member-equal a x)
                 t
               (intersectp-equal x y))))
    Basic set reasoning

    Theorem: intersectp-of-self

    (defthm intersectp-of-self
      (equal (intersectp x x) (consp x)))