• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Set
        • Soft
        • C
        • Bv
        • Imp-language
        • Event-macros
        • Java
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
        • Prime-fields
        • Json
        • Syntheto
          • Process-syntheto-toplevel-fn
          • Translation
          • Language
            • Static-semantics
            • Abstract-syntax
              • Expression
              • Expression-sum-field-list
              • Type
              • Binary-op
              • Expression-product-field-list
              • Abstract-syntax-operations
              • Function-definition-list->header-list
              • Type-definition-list->name-list
              • Initializer-list->value-list
              • Function-header-list->name-list
              • Typed-variable-list->type-list
              • Typed-variable-list->name-list
              • Branch-list->condition-list
              • Alternative-list->name-list
              • Function-specifier
              • Expression-variable-list
              • Type-subset
              • Field-list->type-list
              • Field-list->name-list
              • Function-specification
              • Identifier
              • Toplevel
              • Function-definer
              • Function-header
              • Type-definer
              • Literal
                • Literal-case
                • Literal-fix
                  • Literal-equiv
                  • Literalp
                  • Literal-string
                  • Literal-integer
                  • Literal-character
                  • Literal-boolean
                  • Literal-kind
                • Type-product
                • Function-definition
                • Type-sum
                • Maybe-expression
                • Transform-argument-value
                • Transform
                • Theorem
                • Quantifier
                • Maybe-function-specification
                • Maybe-typed-variable
                • Maybe-type-definition
                • Maybe-function-header
                • Maybe-function-definition
                • Maybe-type-sum
                • Maybe-type-subset
                • Maybe-type-product
                • Maybe-type-definer
                • Maybe-theorem
                • Maybe-type
                • Initializer
                • Type-definition
                • Alternative
                • Unary-op
                • Typed-variable
                • Branch
                • Field
                • Transform-argument
                • Type-recursion
                • Program
                • Function-recursion
                • Typed-variable-list
                • Toplevel-name
                • Toplevel-list
                • Initializer-list
                • Expression-fixtypes
                • Toplevel-fn-names
                • Lookup-transform-argument
                • Function-definition-names
                • Type-definition-list
                • Transform-argument-list
                • Function-header-list
                • Function-definition-list
                • Alternative-list
                • Type-list
                • Identifier-set
                • Identifier-list
                • Field-list
                • Expression-list
                • Branch-list
                • Extract-default-param-alist
                • Create-arg-defaults-table
              • Outcome
              • Abstract-syntax-operations
              • Outcome-list
              • Outcomes
            • Process-syntheto-toplevel
            • Shallow-embedding
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Literal

    Literal-fix

    Fixing function for literal structures.

    Signature
    (literal-fix x) → new-x
    Arguments
    x — Guard (literalp x).
    Returns
    new-x — Type (literalp new-x).

    Definitions and Theorems

    Function: literal-fix$inline

    (defun literal-fix$inline (x)
     (declare (xargs :guard (literalp x)))
     (let ((__function__ 'literal-fix))
      (declare (ignorable __function__))
      (mbe
          :logic
          (case (literal-kind x)
            (:boolean (b* ((value (bool-fix (std::da-nth 0 (cdr x)))))
                        (cons :boolean (list value))))
            (:character (b* ((value (char-fix (std::da-nth 0 (cdr x)))))
                          (cons :character (list value))))
            (:string (b* ((value (str-fix (std::da-nth 0 (cdr x)))))
                       (cons :string (list value))))
            (:integer (b* ((value (nfix (std::da-nth 0 (cdr x)))))
                        (cons :integer (list value)))))
          :exec x)))

    Theorem: literalp-of-literal-fix

    (defthm literalp-of-literal-fix
      (b* ((new-x (literal-fix$inline x)))
        (literalp new-x))
      :rule-classes :rewrite)

    Theorem: literal-fix-when-literalp

    (defthm literal-fix-when-literalp
      (implies (literalp x)
               (equal (literal-fix x) x)))

    Function: literal-equiv$inline

    (defun literal-equiv$inline (acl2::x acl2::y)
      (declare (xargs :guard (and (literalp acl2::x)
                                  (literalp acl2::y))))
      (equal (literal-fix acl2::x)
             (literal-fix acl2::y)))

    Theorem: literal-equiv-is-an-equivalence

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

    Theorem: literal-equiv-implies-equal-literal-fix-1

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

    Theorem: literal-fix-under-literal-equiv

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

    Theorem: equal-of-literal-fix-1-forward-to-literal-equiv

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

    Theorem: equal-of-literal-fix-2-forward-to-literal-equiv

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

    Theorem: literal-equiv-of-literal-fix-1-forward

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

    Theorem: literal-equiv-of-literal-fix-2-forward

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

    Theorem: literal-kind$inline-of-literal-fix-x

    (defthm literal-kind$inline-of-literal-fix-x
      (equal (literal-kind$inline (literal-fix x))
             (literal-kind$inline x)))

    Theorem: literal-kind$inline-literal-equiv-congruence-on-x

    (defthm literal-kind$inline-literal-equiv-congruence-on-x
      (implies (literal-equiv x x-equiv)
               (equal (literal-kind$inline x)
                      (literal-kind$inline x-equiv)))
      :rule-classes :congruence)

    Theorem: consp-of-literal-fix

    (defthm consp-of-literal-fix
      (consp (literal-fix x))
      :rule-classes :type-prescription)