• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Abstract-syntax
          • Syntax-abstraction
          • Expression
          • Definition
          • Constraint
          • Definition-option
          • Abstract-syntax-operations
            • Expression-var-list
            • Lookup-definition
            • Constrel
            • Constraint-constrels
            • Constraint-list-constrels
            • Constraint-rels
            • Constraint-list-rels
            • Expression-sub
            • Expression-const/var-listp
            • Expression-var-listp
            • Expression-neg
            • Expression-list-vars
            • Expression-vars
            • Definition-free-vars
            • Constraint-vars
            • Constraint-list-vars
            • Constrel-set
              • Constrel-sfix
              • Constrel-setp
              • Constrel-sequiv
            • System
            • Convenience-constructors
            • System-result
            • Expression-result
            • Expression-list-result
            • Definition-result
            • Definition-list-result
            • Constraint-result
            • Constraint-list-result
            • Expression-list
            • Definition-list
            • Constraint-list
          • R1cs-subset
          • Semantics
          • Abstract-syntax-operations
            • Expression-var-list
            • Lookup-definition
            • Constrel
            • Constraint-constrels
            • Constraint-list-constrels
            • Constraint-rels
            • Constraint-list-rels
            • Expression-sub
            • Expression-const/var-listp
            • Expression-var-listp
            • Expression-neg
            • Expression-list-vars
            • Expression-vars
            • Definition-free-vars
            • Constraint-vars
            • Constraint-list-vars
            • Constrel-set
              • Constrel-sfix
              • Constrel-setp
              • Constrel-sequiv
            • Indexed-names
            • Well-formedness
            • Concrete-syntax
            • R1cs-bridge
            • Parser-interface
          • Legacy-defrstobj
          • Proof-checker-array
          • Soft
          • C
          • Farray
          • Rp-rewriter
          • Instant-runoff-voting
          • Imp-language
          • Sidekick
          • Leftist-trees
          • Java
          • Taspi
          • Bitcoin
          • Riscv
          • Des
          • Ethereum
          • X86isa
          • Sha-2
          • Yul
          • Zcash
          • Proof-checker-itp13
          • Regex
          • ACL2-programming-language
          • Json
          • Jfkr
          • Equational
          • Cryptography
          • Poseidon
          • Where-do-i-place-my-book
          • Axe
          • Bigmems
          • Builtins
          • Execloader
          • Aleo
          • Solidity
          • Paco
          • Concurrent-programs
          • Bls12-377-curves
        • Debugging
        • Std
        • Proof-automation
        • Macro-libraries
        • ACL2
        • Interfacing-tools
        • Hardware-verification
        • Software-verification
        • Math
        • Testing-utilities
      • Constrel-set

      Constrel-sequiv

      Basic equivalence relation for constrel-set structures.

      Definitions and Theorems

      Function: constrel-sequiv$inline

      (defun constrel-sequiv$inline (acl2::x acl2::y)
        (declare (xargs :guard (and (constrel-setp acl2::x)
                                    (constrel-setp acl2::y))))
        (equal (constrel-sfix acl2::x)
               (constrel-sfix acl2::y)))

      Theorem: constrel-sequiv-is-an-equivalence

      (defthm constrel-sequiv-is-an-equivalence
        (and (booleanp (constrel-sequiv x y))
             (constrel-sequiv x x)
             (implies (constrel-sequiv x y)
                      (constrel-sequiv y x))
             (implies (and (constrel-sequiv x y)
                           (constrel-sequiv y z))
                      (constrel-sequiv x z)))
        :rule-classes (:equivalence))

      Theorem: constrel-sequiv-implies-equal-constrel-sfix-1

      (defthm constrel-sequiv-implies-equal-constrel-sfix-1
        (implies (constrel-sequiv acl2::x x-equiv)
                 (equal (constrel-sfix acl2::x)
                        (constrel-sfix x-equiv)))
        :rule-classes (:congruence))

      Theorem: constrel-sfix-under-constrel-sequiv

      (defthm constrel-sfix-under-constrel-sequiv
        (constrel-sequiv (constrel-sfix acl2::x)
                         acl2::x)
        :rule-classes (:rewrite :rewrite-quoted-constant))

      Theorem: equal-of-constrel-sfix-1-forward-to-constrel-sequiv

      (defthm equal-of-constrel-sfix-1-forward-to-constrel-sequiv
        (implies (equal (constrel-sfix acl2::x) acl2::y)
                 (constrel-sequiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

      Theorem: equal-of-constrel-sfix-2-forward-to-constrel-sequiv

      (defthm equal-of-constrel-sfix-2-forward-to-constrel-sequiv
        (implies (equal acl2::x (constrel-sfix acl2::y))
                 (constrel-sequiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

      Theorem: constrel-sequiv-of-constrel-sfix-1-forward

      (defthm constrel-sequiv-of-constrel-sfix-1-forward
        (implies (constrel-sequiv (constrel-sfix acl2::x)
                                  acl2::y)
                 (constrel-sequiv acl2::x acl2::y))
        :rule-classes :forward-chaining)

      Theorem: constrel-sequiv-of-constrel-sfix-2-forward

      (defthm constrel-sequiv-of-constrel-sfix-2-forward
        (implies (constrel-sequiv acl2::x (constrel-sfix acl2::y))
                 (constrel-sequiv acl2::x acl2::y))
        :rule-classes :forward-chaining)