• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Error-checking
        • Apt
        • Abnf
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Omaps
            • Defomap
            • Update
            • Mapp
            • Update*
            • Size
            • From-lists
            • In
            • Compatiblep
            • Head
            • Rlookup
              • Map
              • Submap
              • Empty
              • Tail
              • In*
              • Rlookup*
              • Restrict
              • Lookup*
              • Delete*
              • Delete
              • Mfix
              • Lookup
              • Values
              • Keys
              • Head-val
              • Head-key
            • Directed-untranslate
            • Include-book-paths
            • Ubi
            • Checkpoint-list
            • Digits-any-base
            • Context-message-pair
            • Numbered-names
            • With-auto-termination
            • Theorems-about-true-list-lists
            • Make-termination-theorem
            • Sublis-expr+
            • Prove$
            • Defthm<w
            • System-utilities-non-built-in
            • Integer-range-fix
            • Add-const-to-untranslate-preprocess
            • Integers-from-to
            • Minimize-ruler-extenders
            • Unsigned-byte-fix
            • Signed-byte-fix
            • Defthmr
            • Paired-names
            • Unsigned-byte-list-fix
            • Signed-byte-list-fix
            • Show-books
            • Checkpoint-list-pretty
            • List-utilities
            • Skip-in-book
            • Typed-tuplep
            • Defunt
            • Keyword-value-list-to-alist
            • Magic-macroexpand
            • Top-command-number-fn
            • Bits-as-digits-in-base-2
            • Show-checkpoint-list
            • Ubyte11s-as-digits-in-base-2048
            • Named-formulas
            • Bytes-as-digits-in-base-256
            • String-utilities
            • Make-keyword-value-list-from-keys-and-value
            • Integer-range-listp
            • Defmacroq
            • Apply-fn-if-known
            • Trans-eval-error-triple
            • Checkpoint-info-list
            • Previous-subsumer-hints
            • Fms!-lst
            • Zp-listp
            • Doublets-to-alist
            • Trans-eval-state
            • Injections
            • Theorems-about-osets
            • Typed-list-utilities
            • Book-runes-alist
            • User-interface
            • Bits/ubyte11s-digit-grouping
            • Bits/bytes-digit-grouping
            • Message-utilities
            • Subsetp-eq-linear
            • Strict-merge-sort-<
            • Miscellaneous-enumerations
            • Maybe-unquote
            • Oset-utilities
            • Thm<w
            • Defthmd<w
          • Prime-field-constraint-systems
          • Soft
          • Bv
          • Imp-language
          • Event-macros
          • Bitcoin
          • Ethereum
          • Yul
          • Zcash
          • ACL2-programming-language
          • Prime-fields
          • Java
          • C
          • Syntheto
          • Number-theory
          • Cryptography
          • Lists-light
          • File-io-light
          • Json
          • Built-ins
          • Solidity
          • Axe
          • Std-extensions
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Execloader
        • Axe
      • Testing-utilities
      • Math
    • Omaps

    Rlookup

    Set of keys to which a value is associated.

    Signature
    (rlookup val map) → keys
    Arguments
    map — Guard (mapp map).
    Returns
    keys — Type (setp keys).

    The resulting set is empty if the value is not in the omap. The resulting set is a singleton if the value is associated to exactly one key. Otherwise, the resulting set contains two or more keys.

    This is the ``reverse'' of lookup, which motivates the r in the name.

    Definitions and Theorems

    Function: rlookup

    (defun
        rlookup (val map)
        (declare (xargs :guard (mapp map)))
        (let ((__function__ 'rlookup))
             (declare (ignorable __function__))
             (cond ((empty map) nil)
                   (t (mv-let (key0 val0)
                              (head map)
                              (if (equal val val0)
                                  (insert key0 (rlookup val (tail map)))
                                  (rlookup val (tail map))))))))

    Theorem: setp-of-rlookup

    (defthm setp-of-rlookup
            (b* ((keys (rlookup val map)))
                (setp keys))
            :rule-classes :rewrite)

    Theorem: rlookup-when-empty

    (defthm rlookup-when-empty
            (implies (empty map)
                     (equal (rlookup val map) nil))
            :rule-classes (:rewrite :type-prescription))