• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • C
      • Proof-checker-array
      • Soft
        • Soft-future-work
        • Soft-macros
        • Updates-to-workshop-material
        • Soft-implementation
          • Soft-implementation-core
            • Sothm-inst-facts
            • Ext-fun-subst-term/terms/function
            • Fun-subst-function
            • Sothm-inst-pairs
            • Funvars-of-term/terms
            • Funvars-of-plain-fn
            • Sothm-inst-proof
            • Fun-subst-term/terms
            • Get-sof-instance
            • Sof-instancesp
            • Put-sof-instance
            • Fun-substp
            • Sofun-kindp
            • Funvar-listp
            • *-listp
            • Funvars-of-quantifier-fn
            • No-trivial-pairsp
              • Funvars-of-choice-fn
              • Funvar-instp
              • Funvars-of-thm
              • Sofunp
              • Funvarp
              • Sof-instances
              • Sothmp
              • Quant-sofunp
              • Plain-sofunp
              • Funvar-inst-listp
              • Choice-sofunp
              • Sofun-funvars
              • Sofun-kind
              • Function-variables-table
              • Sof-instances-table
              • Second-order-functions-table
            • Gen-macro2-of-macro
            • Defun-inst-implementation
            • Defthm-inst-implementation
            • Defsoft-implementation
            • Defunvar-implementation
            • Defund-sk2-implementation
            • Defun-sk2-implementation
            • Define-sk2-implementation
            • Defchoose2-implementation
            • Defund2-implementation
            • Defun2-implementation
            • Define2-implementation
          • Soft-notions
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Ethereum
        • Leftist-trees
        • Java
        • Riscv
        • Taspi
        • Bitcoin
        • Zcash
        • Des
        • X86isa
        • Sha-2
        • Yul
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Axe
        • Poseidon
        • Where-do-i-place-my-book
        • Aleo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Soft-implementation-core

    No-trivial-pairsp

    Check if an alist has no pairs with equal key and value.

    Signature
    (no-trivial-pairsp alist) → yes/no
    Arguments
    alist — Guard (alistp alist).
    Returns
    yes/no — Type (booleanp yes/no).

    This is a constraint satisfied by function substitutions; see fun-substp. A pair that substitutes a function with itself would have no effect, so such pairs are useless.

    Definitions and Theorems

    Function: no-trivial-pairsp

    (defun no-trivial-pairsp (alist)
      (declare (xargs :guard (alistp alist)))
      (let ((__function__ 'no-trivial-pairsp))
        (declare (ignorable __function__))
        (if (endp alist)
            t
          (let ((pair (car alist)))
            (and (not (equal (car pair) (cdr pair)))
                 (no-trivial-pairsp (cdr alist)))))))

    Theorem: booleanp-of-no-trivial-pairsp

    (defthm booleanp-of-no-trivial-pairsp
      (b* ((yes/no (no-trivial-pairsp alist)))
        (booleanp yes/no))
      :rule-classes :rewrite)