• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
      • Proof-support
      • Semantics
      • Lifting
      • R1cs-subset
      • Well-formedness
      • Abstract-syntax
        • Syntax-abstraction
        • Abstract-syntax-trees
          • Expression
          • Name
          • Definition
          • Constraint
          • Definition-option
          • System
          • System-result
          • Name-list-result
          • Expression-result
          • Expression-list-result
          • Definition-result
          • Definition-list-result
          • Constraint-result
          • Constraint-list-result
          • Name-result
          • Expression-list
          • Definition-list
          • Constraint-list
          • Name-set
          • Name-list
            • Name-list-fix
            • Name-list-equiv
            • Name-listp
        • Abstract-syntax-operations
        • Convenience-constructors
      • 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
    • 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
  • ACL2
  • Macro-libraries
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Name-list

Name-list-fix

(name-list-fix x) is a usual ACL2::fty list fixing function.

Signature

(name-list-fix x) → fty::newx

Arguments

x — Guard (name-listp x).

Returns

fty::newx — Type (name-listp fty::newx).

In the logic, we apply name-fix to each member of the x. In the execution, none of that is actually necessary and this is just an inlined identity function.

Definitions and Theorems

Function: name-list-fix$inline

(defun name-list-fix$inline (x)
  (declare (xargs :guard (name-listp x)))
  (let ((__function__ 'name-list-fix))
    (declare (ignorable __function__))
    (mbe :logic
         (if (atom x)
             nil
           (cons (name-fix (car x))
                 (name-list-fix (cdr x))))
         :exec x)))

Theorem: name-listp-of-name-list-fix

(defthm name-listp-of-name-list-fix
  (b* ((fty::newx (name-list-fix$inline x)))
    (name-listp fty::newx))
  :rule-classes :rewrite)

Theorem: name-list-fix-when-name-listp

(defthm name-list-fix-when-name-listp
  (implies (name-listp x)
           (equal (name-list-fix x) x)))

Function: name-list-equiv$inline

(defun name-list-equiv$inline (acl2::x acl2::y)
  (declare (xargs :guard (and (name-listp acl2::x)
                              (name-listp acl2::y))))
  (equal (name-list-fix acl2::x)
         (name-list-fix acl2::y)))

Theorem: name-list-equiv-is-an-equivalence

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

Theorem: name-list-equiv-implies-equal-name-list-fix-1

(defthm name-list-equiv-implies-equal-name-list-fix-1
  (implies (name-list-equiv acl2::x x-equiv)
           (equal (name-list-fix acl2::x)
                  (name-list-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: name-list-fix-under-name-list-equiv

(defthm name-list-fix-under-name-list-equiv
  (name-list-equiv (name-list-fix acl2::x)
                   acl2::x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-name-list-fix-1-forward-to-name-list-equiv

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

Theorem: equal-of-name-list-fix-2-forward-to-name-list-equiv

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

Theorem: name-list-equiv-of-name-list-fix-1-forward

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

Theorem: name-list-equiv-of-name-list-fix-2-forward

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

Theorem: car-of-name-list-fix-x-under-name-equiv

(defthm car-of-name-list-fix-x-under-name-equiv
  (name-equiv (car (name-list-fix acl2::x))
              (car acl2::x)))

Theorem: car-name-list-equiv-congruence-on-x-under-name-equiv

(defthm car-name-list-equiv-congruence-on-x-under-name-equiv
  (implies (name-list-equiv acl2::x x-equiv)
           (name-equiv (car acl2::x)
                       (car x-equiv)))
  :rule-classes :congruence)

Theorem: cdr-of-name-list-fix-x-under-name-list-equiv

(defthm cdr-of-name-list-fix-x-under-name-list-equiv
  (name-list-equiv (cdr (name-list-fix acl2::x))
                   (cdr acl2::x)))

Theorem: cdr-name-list-equiv-congruence-on-x-under-name-list-equiv

(defthm cdr-name-list-equiv-congruence-on-x-under-name-list-equiv
  (implies (name-list-equiv acl2::x x-equiv)
           (name-list-equiv (cdr acl2::x)
                            (cdr x-equiv)))
  :rule-classes :congruence)

Theorem: cons-of-name-fix-x-under-name-list-equiv

(defthm cons-of-name-fix-x-under-name-list-equiv
  (name-list-equiv (cons (name-fix acl2::x) acl2::y)
                   (cons acl2::x acl2::y)))

Theorem: cons-name-equiv-congruence-on-x-under-name-list-equiv

(defthm cons-name-equiv-congruence-on-x-under-name-list-equiv
  (implies (name-equiv acl2::x x-equiv)
           (name-list-equiv (cons acl2::x acl2::y)
                            (cons x-equiv acl2::y)))
  :rule-classes :congruence)

Theorem: cons-of-name-list-fix-y-under-name-list-equiv

(defthm cons-of-name-list-fix-y-under-name-list-equiv
  (name-list-equiv (cons acl2::x (name-list-fix acl2::y))
                   (cons acl2::x acl2::y)))

Theorem: cons-name-list-equiv-congruence-on-y-under-name-list-equiv

(defthm cons-name-list-equiv-congruence-on-y-under-name-list-equiv
  (implies (name-list-equiv acl2::y y-equiv)
           (name-list-equiv (cons acl2::x acl2::y)
                            (cons acl2::x y-equiv)))
  :rule-classes :congruence)

Theorem: consp-of-name-list-fix

(defthm consp-of-name-list-fix
  (equal (consp (name-list-fix acl2::x))
         (consp acl2::x)))

Theorem: name-list-fix-under-iff

(defthm name-list-fix-under-iff
  (iff (name-list-fix acl2::x)
       (consp acl2::x)))

Theorem: name-list-fix-of-cons

(defthm name-list-fix-of-cons
  (equal (name-list-fix (cons a x))
         (cons (name-fix a) (name-list-fix x))))

Theorem: len-of-name-list-fix

(defthm len-of-name-list-fix
  (equal (len (name-list-fix acl2::x))
         (len acl2::x)))

Theorem: name-list-fix-of-append

(defthm name-list-fix-of-append
  (equal (name-list-fix (append std::a std::b))
         (append (name-list-fix std::a)
                 (name-list-fix std::b))))

Theorem: name-list-fix-of-repeat

(defthm name-list-fix-of-repeat
  (equal (name-list-fix (repeat acl2::n acl2::x))
         (repeat acl2::n (name-fix acl2::x))))

Theorem: list-equiv-refines-name-list-equiv

(defthm list-equiv-refines-name-list-equiv
  (implies (list-equiv acl2::x acl2::y)
           (name-list-equiv acl2::x acl2::y))
  :rule-classes :refinement)

Theorem: nth-of-name-list-fix

(defthm nth-of-name-list-fix
  (equal (nth acl2::n (name-list-fix acl2::x))
         (if (< (nfix acl2::n) (len acl2::x))
             (name-fix (nth acl2::n acl2::x))
           nil)))

Theorem: name-list-equiv-implies-name-list-equiv-append-1

(defthm name-list-equiv-implies-name-list-equiv-append-1
  (implies (name-list-equiv acl2::x fty::x-equiv)
           (name-list-equiv (append acl2::x acl2::y)
                            (append fty::x-equiv acl2::y)))
  :rule-classes (:congruence))

Theorem: name-list-equiv-implies-name-list-equiv-append-2

(defthm name-list-equiv-implies-name-list-equiv-append-2
  (implies (name-list-equiv acl2::y fty::y-equiv)
           (name-list-equiv (append acl2::x acl2::y)
                            (append acl2::x fty::y-equiv)))
  :rule-classes (:congruence))

Theorem: name-list-equiv-implies-name-list-equiv-nthcdr-2

(defthm name-list-equiv-implies-name-list-equiv-nthcdr-2
  (implies (name-list-equiv acl2::l l-equiv)
           (name-list-equiv (nthcdr acl2::n acl2::l)
                            (nthcdr acl2::n l-equiv)))
  :rule-classes (:congruence))

Theorem: name-list-equiv-implies-name-list-equiv-take-2

(defthm name-list-equiv-implies-name-list-equiv-take-2
  (implies (name-list-equiv acl2::l l-equiv)
           (name-list-equiv (take acl2::n acl2::l)
                            (take acl2::n l-equiv)))
  :rule-classes (:congruence))