• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Pfcs
        • Proof-support
        • Semantics
          • Exec-proof-tree
          • Assertion-list->constr-list
          • Assertion-list->asg-list
          • Eval-expr
          • Eval-expr-list
          • Assignment-wfp
          • Assertion
          • Proof-outcome
          • Proof-list-outcome
          • Assertion-list-from
          • Definition-satp
          • Constraint-satp
          • Assignment
          • System-satp
          • Constraint-list-satp
          • Assertion-list
          • Assignment-list
          • Proof-trees
            • Proof-tree
              • Proof-tree-case
              • Proof-tree-relation
              • Proof-tree-equiv
                • Proof-tree-equal
                • Proof-treep
                • Proof-tree-kind
                • Proof-tree-fix
                • Proof-tree-count
              • Proof-tree-list
          • Lifting
          • R1cs-subset
          • Indexed-names
          • Well-formedness
          • Abstract-syntax
          • Concrete-syntax
          • R1cs-bridge
          • Parser-interface
        • Wp-gen
        • Dimacs-reader
        • Legacy-defrstobj
        • Proof-checker-array
        • Soft
        • C
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Riscv
        • Bitcoin
        • 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
        • Aleo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Community
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Proof-tree

    Proof-tree-equiv

    Basic equivalence relation for proof-tree structures.

    Definitions and Theorems

    Function: proof-tree-equiv$inline

    (defun proof-tree-equiv$inline (acl2::x acl2::y)
      (declare (xargs :guard (and (proof-treep acl2::x)
                                  (proof-treep acl2::y))))
      (equal (proof-tree-fix acl2::x)
             (proof-tree-fix acl2::y)))

    Theorem: proof-tree-equiv-is-an-equivalence

    (defthm proof-tree-equiv-is-an-equivalence
      (and (booleanp (proof-tree-equiv x y))
           (proof-tree-equiv x x)
           (implies (proof-tree-equiv x y)
                    (proof-tree-equiv y x))
           (implies (and (proof-tree-equiv x y)
                         (proof-tree-equiv y z))
                    (proof-tree-equiv x z)))
      :rule-classes (:equivalence))

    Theorem: proof-tree-equiv-implies-equal-proof-tree-fix-1

    (defthm proof-tree-equiv-implies-equal-proof-tree-fix-1
      (implies (proof-tree-equiv acl2::x x-equiv)
               (equal (proof-tree-fix acl2::x)
                      (proof-tree-fix x-equiv)))
      :rule-classes (:congruence))

    Theorem: proof-tree-fix-under-proof-tree-equiv

    (defthm proof-tree-fix-under-proof-tree-equiv
      (proof-tree-equiv (proof-tree-fix acl2::x)
                        acl2::x)
      :rule-classes (:rewrite :rewrite-quoted-constant))

    Theorem: equal-of-proof-tree-fix-1-forward-to-proof-tree-equiv

    (defthm equal-of-proof-tree-fix-1-forward-to-proof-tree-equiv
      (implies (equal (proof-tree-fix acl2::x) acl2::y)
               (proof-tree-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: equal-of-proof-tree-fix-2-forward-to-proof-tree-equiv

    (defthm equal-of-proof-tree-fix-2-forward-to-proof-tree-equiv
      (implies (equal acl2::x (proof-tree-fix acl2::y))
               (proof-tree-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: proof-tree-equiv-of-proof-tree-fix-1-forward

    (defthm proof-tree-equiv-of-proof-tree-fix-1-forward
      (implies (proof-tree-equiv (proof-tree-fix acl2::x)
                                 acl2::y)
               (proof-tree-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: proof-tree-equiv-of-proof-tree-fix-2-forward

    (defthm proof-tree-equiv-of-proof-tree-fix-2-forward
      (implies (proof-tree-equiv acl2::x (proof-tree-fix acl2::y))
               (proof-tree-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)