• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
      • Sv
        • Svex-stvs
        • Svex-fixpoint-decomposition-methodology
        • Sv-versus-esim
        • Svex-decomp
        • Svex-compose-dfs
        • Moddb
        • Svex-compilation
          • Alias-normalization
          • Svex-design-flatten-and-normalize
          • Svex-design-compile
          • Svex-composition
          • Compile.lisp
            • Svex-normalize-assigns
            • Svex-design-flatten
            • Svex-override-lhrange
            • Svex-override-lhs
            • Svex-compose-assigns/delays
            • Aliases-indexed->named-aux
            • Svex-alist-truncate-by-var-decls
            • Svar-map-truncate-by-var-decls
            • Aliases-to-var-decl-map-aux
            • Aliases-indexed->named
            • Svar-indexed->named-memo
            • Lhs-indexed->named
            • Maybe-svar-p
            • Svar-register-indnamememo
            • Svarlist-indexed->named
            • Maybe-svar-fix
            • Lhs-register-indnamememo
            • Maybe-indname-result
              • Maybe-indname-result-fix
                • Maybe-indname-result-equiv
                • Maybe-indname-result-case
                • Maybe-indname-result-some
                • Maybe-indname-result-none
                • Maybe-indname-result-p
              • Aliases-to-var-decl-map
              • Svar-indexed->named
              • Svex-apply-overrides
              • Aliases-boundedp-aux
              • Indnamememo-to-var-decl-map
              • Indname-result
              • Assigns-compose
              • Delay-svarlist->delays
              • Svex-override-vars
              • Indnamememo
              • Delay-svar->delays
              • Assigns-to-overrides
              • Svarlist-collect-delays
              • Svex-overridelist-vars
              • Svex-overridelist-keys
              • Assigns-to-overrides-nrev
              • Cap-length
              • Var-decl-map
            • Assign->netassigns
          • Svmods
          • Svstmt
          • Sv-tutorial
          • Expressions
          • Symbolic-test-vector
          • Vl-to-svex
        • Vwsim
        • Fgl
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Testing-utilities
      • Math
    • Maybe-indname-result

    Maybe-indname-result-fix

    Fixing function for maybe-indname-result structures.

    Signature
    (maybe-indname-result-fix x) → new-x
    Arguments
    x — Guard (maybe-indname-result-p x).
    Returns
    new-x — Type (maybe-indname-result-p new-x).

    Definitions and Theorems

    Function: maybe-indname-result-fix$inline

    (defun
       maybe-indname-result-fix$inline (x)
       (declare (xargs :guard (maybe-indname-result-p x)))
       (let ((__function__ 'maybe-indname-result-fix))
            (declare (ignorable __function__))
            (mbe :logic (cond ((not x) nil)
                              (t (b* ((fty::val (indname-result-fix x)))
                                     fty::val)))
                 :exec x)))

    Theorem: maybe-indname-result-p-of-maybe-indname-result-fix

    (defthm maybe-indname-result-p-of-maybe-indname-result-fix
            (b* ((new-x (maybe-indname-result-fix$inline x)))
                (maybe-indname-result-p new-x))
            :rule-classes :rewrite)

    Theorem: maybe-indname-result-fix-when-maybe-indname-result-p

    (defthm maybe-indname-result-fix-when-maybe-indname-result-p
            (implies (maybe-indname-result-p x)
                     (equal (maybe-indname-result-fix x) x)))

    Function: maybe-indname-result-equiv$inline

    (defun maybe-indname-result-equiv$inline (x y)
           (declare (xargs :guard (and (maybe-indname-result-p x)
                                       (maybe-indname-result-p y))))
           (equal (maybe-indname-result-fix x)
                  (maybe-indname-result-fix y)))

    Theorem: maybe-indname-result-equiv-is-an-equivalence

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

    Theorem: maybe-indname-result-equiv-implies-equal-maybe-indname-result-fix-1

    (defthm
     maybe-indname-result-equiv-implies-equal-maybe-indname-result-fix-1
     (implies (maybe-indname-result-equiv x x-equiv)
              (equal (maybe-indname-result-fix x)
                     (maybe-indname-result-fix x-equiv)))
     :rule-classes (:congruence))

    Theorem: maybe-indname-result-fix-under-maybe-indname-result-equiv

    (defthm maybe-indname-result-fix-under-maybe-indname-result-equiv
            (maybe-indname-result-equiv (maybe-indname-result-fix x)
                                        x)
            :rule-classes (:rewrite :rewrite-quoted-constant))

    Theorem: equal-of-maybe-indname-result-fix-1-forward-to-maybe-indname-result-equiv

    (defthm
     equal-of-maybe-indname-result-fix-1-forward-to-maybe-indname-result-equiv
     (implies (equal (maybe-indname-result-fix x) y)
              (maybe-indname-result-equiv x y))
     :rule-classes :forward-chaining)

    Theorem: equal-of-maybe-indname-result-fix-2-forward-to-maybe-indname-result-equiv

    (defthm
     equal-of-maybe-indname-result-fix-2-forward-to-maybe-indname-result-equiv
     (implies (equal x (maybe-indname-result-fix y))
              (maybe-indname-result-equiv x y))
     :rule-classes :forward-chaining)

    Theorem: maybe-indname-result-equiv-of-maybe-indname-result-fix-1-forward

    (defthm
       maybe-indname-result-equiv-of-maybe-indname-result-fix-1-forward
       (implies (maybe-indname-result-equiv (maybe-indname-result-fix x)
                                            y)
                (maybe-indname-result-equiv x y))
       :rule-classes :forward-chaining)

    Theorem: maybe-indname-result-equiv-of-maybe-indname-result-fix-2-forward

    (defthm
        maybe-indname-result-equiv-of-maybe-indname-result-fix-2-forward
        (implies
             (maybe-indname-result-equiv x (maybe-indname-result-fix y))
             (maybe-indname-result-equiv x y))
        :rule-classes :forward-chaining)