• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
      • Apt
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Legacy-defrstobj
      • Prime-field-constraint-systems
      • Proof-checker-array
      • Soft
      • Rp-rewriter
      • Farray
      • Instant-runoff-voting
        • Fairness-criteria
        • Candidate-with-least-nth-place-votes
        • Eliminate-candidate
        • First-choice-of-majority-p
        • Candidate-ids
        • Irv
        • Create-nth-choice-count-alist
        • Irv-alt
        • Irv-ballot-p
          • Non-empty-true-list-listp
        • Majority
        • Number-of-candidates
        • List-elements-equal
        • Number-of-voters
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Taspi
      • Bitcoin
      • Des
      • Ethereum
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Bigmem
      • Regex
      • ACL2-programming-language
      • Java
      • C
      • Jfkr
      • X86isa
      • Equational
      • Cryptography
      • Where-do-i-place-my-book
      • Json
      • Built-ins
      • Execloader
      • Solidity
      • Paco
      • Concurrent-programs
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Testing-utilities
    • Math
  • Instant-runoff-voting

Irv-ballot-p

Recognizer for a well-formed IRV ballot

Signature
(irv-ballot-p xs) → *

Definitions and Theorems

Function: irv-ballot-p

(defun irv-ballot-p (xs)
       (declare (xargs :guard t))
       (let ((__function__ 'irv-ballot-p))
            (declare (ignorable __function__))
            (if (consp xs)
                (b* ((one (car xs)) (rest (cdr xs)))
                    (and (nat-listp one)
                         one (no-duplicatesp-equal one)
                         (irv-ballot-p rest)))
                (equal xs nil))))

Theorem: irv-ballot-p-implies-non-empty-true-list-listp

(defthm irv-ballot-p-implies-non-empty-true-list-listp
        (implies (irv-ballot-p xs)
                 (non-empty-true-list-listp xs))
        :rule-classes :forward-chaining)

Theorem: irv-ballot-p-cdr

(defthm irv-ballot-p-cdr
        (implies (irv-ballot-p xs)
                 (irv-ballot-p (cdr xs))))

Subtopics

Non-empty-true-list-listp
Similar to true-list-listp, except that if x is non-empty, each element of x must be non-nil.