• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • C
    • Java
    • Taspi
    • Bitcoin
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Yul
    • Riscv
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
      • Poseidon-main-definition
        • Param
        • Hashp
        • Absorb1
        • Sponge
        • Hash
        • All-rounds
        • Sponge-validp
        • Squeeze1
        • Sub-words-partial
        • Squeeze
        • Round
        • Partial-rounds
        • Mode
          • Mode-case
          • Mode-fix
          • Mode-equiv
          • Modep
          • Mode-squeeze
          • Mode-absorb
          • Mode-kind
        • Full-rounds
        • Permute
        • Sub-words
        • Add-round-constants
        • Mix-layer
        • Dot-product
        • Absorb
        • Pow-by-alpha
        • Param->size
        • Sub-words-full
        • Param->capacity-then-rate-p
        • Param->partial-last-p
        • Param-additional-theorems
        • Param->rounds
        • Param->descending-p
        • Init-sponge
      • Poseidon-instantiations
    • Where-do-i-place-my-book
    • Bigmems
    • Builtins
    • Axe
    • Execloader
    • Solidity
    • Leo
    • Paco
    • Concurrent-programs
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Mode

Mode-fix

Fixing function for mode structures.

Signature

(mode-fix x) → new-x

Arguments

x — Guard (modep x).

Returns

new-x — Type (modep new-x).

Definitions and Theorems

Function: mode-fix$inline

(defun mode-fix$inline (x)
  (declare (xargs :guard (modep x)))
  (let ((__function__ 'mode-fix))
    (declare (ignorable __function__))
    (mbe :logic
         (case (mode-kind x)
           (:absorb (cons :absorb (list)))
           (:squeeze (cons :squeeze (list))))
         :exec x)))

Theorem: modep-of-mode-fix

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

Theorem: mode-fix-when-modep

(defthm mode-fix-when-modep
  (implies (modep x)
           (equal (mode-fix x) x)))

Function: mode-equiv$inline

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

Theorem: mode-equiv-is-an-equivalence

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

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

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

Theorem: mode-fix-under-mode-equiv

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

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

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

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

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

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

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

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

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

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

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

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

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

Theorem: consp-of-mode-fix

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