• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
      • Rule-classes
      • Proof-builder
      • Recursion-and-induction
      • Hons-and-memoization
      • Events
      • Parallelism
      • History
      • Programming
        • Defun
        • Declare
        • System-utilities
        • Stobj
        • State
        • Mutual-recursion
        • Memoize
        • Mbe
        • Io
        • Defpkg
        • Apply$
        • Loop$
        • Programming-with-state
        • Arrays
        • Characters
        • Time$
        • Defmacro
        • Loop$-primer
        • Fast-alists
        • Defconst
        • Evaluation
        • Guard
        • Equality-variants
        • Compilation
        • Hons
        • ACL2-built-ins
        • Developers-guide
        • System-attachments
        • Advanced-features
        • Set-check-invariant-risk
        • Numbers
        • Efficiency
        • Irrelevant-formals
        • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
        • Redefining-programs
        • Lists
          • Member
          • Append
          • List
          • Nth
          • Len
          • True-listp
          • String-listp
          • Nat-listp
          • Character-listp
          • Symbol-listp
          • True-list-listp
          • Length
          • Search
          • Intersection$
          • Union$
          • Remove-duplicates
          • Position
          • Update-nth
          • Take
          • Nthcdr
          • Set-difference$
          • Subsetp
          • No-duplicatesp
          • Concatenate
          • Remove
          • Remove1
          • Intersectp
          • Endp
          • Keyword-value-listp
          • Integer-listp
          • Reverse
          • Add-to-set
          • List-utilities
          • Set-size
          • Revappend
          • Subseq
          • Make-list
          • Last
          • Lists-light
          • Boolean-listp
          • Butlast
          • Pairlis$
          • Substitute
          • Count
            • Duplicity
              • Duplicity-badguy
                • Duplicity-badguy1
                • No-duplicatesp-equal-same-by-duplicity
            • Keyword-listp
            • List*
            • Eqlable-listp
            • Pos-listp
            • Integer-range-listp
            • Rational-listp
            • Evens
            • Atom-listp
            • ACL2-number-listp
            • Typed-list-utilities
            • Odds
            • List$
            • Listp
            • Standard-char-listp
            • Last-cdr
            • Pairlis
            • Proper-consp
            • Improper-consp
            • Pairlis-x2
            • Pairlis-x1
            • Merge-sort-lexorder
            • Fix-true-list
            • Real-listp
          • Invariant-risk
          • Errors
          • Defabbrev
          • Conses
          • Alists
          • Set-register-invariant-risk
          • Strings
          • Program-wrapper
          • Get-internal-time
          • Basics
          • Packages
          • Oracle-eval
          • Defmacro-untouchable
          • <<
          • Primitive
          • Revert-world
          • Unmemoize
          • Set-duplicate-keys-action
          • Symbols
          • Def-list-constructor
          • Easy-simplify-term
          • Defiteration
          • Fake-oracle-eval
          • Defopen
          • Sleep
        • Operational-semantics
        • Real
        • Start-here
        • Debugging
        • Miscellaneous
        • Output-controls
        • Macros
        • Interfacing-tools
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Duplicity-badguy

    Duplicity-badguy1

    (duplicity-badguy1 dom x) finds the first element of dom whose duplicity in x exceeds 1, if such a member exists.

    Definitions and Theorems

    Function: duplicity-badguy1

    (defun duplicity-badguy1 (dom x)
      (declare (xargs :guard t))
      (if (consp dom)
          (if (> (duplicity (car dom) x) 1)
              (list (car dom))
            (duplicity-badguy1 (cdr dom) x))
        nil))

    Theorem: duplicity-badguy1-exists-in-list

    (defthm duplicity-badguy1-exists-in-list
      (implies (duplicity-badguy1 dom x)
               (member-equal (car (duplicity-badguy1 dom x))
                             x)))

    Theorem: duplicity-badguy1-exists-in-dom

    (defthm duplicity-badguy1-exists-in-dom
      (implies (duplicity-badguy1 dom x)
               (member-equal (car (duplicity-badguy1 dom x))
                             dom)))

    Theorem: duplicity-badguy1-has-high-duplicity

    (defthm duplicity-badguy1-has-high-duplicity
      (implies (duplicity-badguy1 dom x)
               (< 1
                  (duplicity (car (duplicity-badguy1 dom x))
                             x))))

    Theorem: duplicity-badguy1-is-complete-for-domain

    (defthm duplicity-badguy1-is-complete-for-domain
      (implies (and (member-equal a dom)
                    (< 1 (duplicity a x)))
               (duplicity-badguy1 dom x)))

    Theorem: duplicity-badguy1-need-only-consider-the-list

    (defthm duplicity-badguy1-need-only-consider-the-list
      (implies (duplicity-badguy1 dom x)
               (duplicity-badguy1 x x)))

    Theorem: no-duplicatesp-equal-when-duplicity-badguy1

    (defthm no-duplicatesp-equal-when-duplicity-badguy1
      (implies (and (not (duplicity-badguy1 dom x))
                    (subsetp-equal x dom))
               (no-duplicatesp-equal x)))