• 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
    • 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
      • Aleobft
      • Aleovm
      • Leo
        • Grammar
        • Early-version
          • Json2ast
          • Testing
          • Definition
            • Flattening
            • Abstract-syntax
              • Expression
              • Syntax-abstraction
              • Statement
              • Files
                • Funparam-list->name-list
                • Fundecl
                • Var/const-sort
                • Structdecl
                • File
                • Finalizer-option
                • Topdecl
                • Mappingdecl
                • Fundecl-option
                • Finalizer
                • Funparam
                • Fun-sort
                • Programdecl
                • Compdecl
                • Var/const-sort-result
                • Topdecl-list-result
                • Programdecl-list-result
                • Importdecl-list-result
                • Funparam-list-result
                • Finalizer-option-result
                • Compdecl-list-result
                • Topdecl-result
                • Structdecl-result
                • Programdecl-result
                • Mappingdecl-result
                • Importdecl-result
                • Importdecl
                • Funparam-result
                • Fundecl-result
                • Fun-sort-result
                • Finalizer-result
                • Compdecl-result
                • File-result
                • Funparam-list
                • Programdecl-list
                • Importdecl-list
                • Compdecl-list
                  • Compdecl-list-fix
                  • Compdecl-list-equiv
                  • Compdecl-listp
                • Var/const-sort-list
                • Topdecl-list
                • Fundecl-list
              • Input-files
              • Identifiers
              • Types
              • Struct-init
              • Branch
              • Statements
              • Format-strings
              • Input-syntax-abstraction
              • Expressions
              • Output-files
              • Addresses
              • Literals
              • Characters
              • Expression-list
              • Statement-list
              • Output-syntax-abstraction
              • Struct-init-list
              • Branch-list
              • Annotations
              • Abstract-syntax-trees
              • Symbols
              • Keywords
              • Programs
              • Packages
              • Bit-sizes
            • Dynamic-semantics
            • Compilation
            • Static-semantics
            • Concrete-syntax
    • 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

• Compdecl-list

Compdecl-list-fix

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

Signature

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

Arguments

x — Guard (compdecl-listp x).

Returns

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

In the logic, we apply compdecl-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: compdecl-list-fix$inline

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

Theorem: compdecl-listp-of-compdecl-list-fix

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

Theorem: compdecl-list-fix-when-compdecl-listp

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

Function: compdecl-list-equiv$inline

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

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

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

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

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

Theorem: compdecl-list-fix-under-compdecl-list-equiv

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Theorem: consp-of-compdecl-list-fix

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

Theorem: compdecl-list-fix-under-iff

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

Theorem: compdecl-list-fix-of-cons

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

Theorem: len-of-compdecl-list-fix

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

Theorem: compdecl-list-fix-of-append

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

Theorem: compdecl-list-fix-of-repeat

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

Theorem: list-equiv-refines-compdecl-list-equiv

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

Theorem: nth-of-compdecl-list-fix

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

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

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

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

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

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

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

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

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