• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
    • Theories
    • Rule-classes
    • Proof-builder
    • Recursion-and-induction
    • Hons-and-memoization
    • Events
    • Parallelism
    • History
    • Programming
      • Defun
      • Declare
      • System-utilities
      • Stobj
      • State
      • Mutual-recursion
      • Memoize
      • Mbe
      • Io
      • Defpkg
      • Apply$
      • Loop$
      • Programming-with-state
      • Arrays
      • Characters
      • Time$
      • Defmacro
      • Loop$-primer
      • Fast-alists
      • Defconst
      • Evaluation
      • Guard
      • Equality-variants
      • Compilation
      • Hons
      • ACL2-built-ins
      • Developers-guide
      • System-attachments
      • Advanced-features
      • Set-check-invariant-risk
      • Numbers
      • Efficiency
      • Irrelevant-formals
      • Introduction-to-programming-in-ACL2-for-those-who-know-lisp
      • Redefining-programs
      • Lists
      • Invariant-risk
      • Errors
      • Defabbrev
      • Conses
      • Alists
        • Omaps
          • Defomap
          • Update
          • Mapp
          • Assoc
          • Update*
          • Size
          • Keys
          • From-lists
          • Update-induction-on-maps
          • Compatiblep
          • Tail
          • Head
          • Restrict
          • Submap
          • Map
          • Rlookup
          • Emptyp
          • Rlookup*
          • Lookup*
          • Delete*
          • Values
          • In*
          • Lookup
          • Delete
          • Mfix
          • Head-val
          • Head-key
          • Omap-induction2
          • Omap-order-rules
        • Std/alists
        • Fast-alists
        • Alistp
        • Misc/records
        • Remove-assocs
        • Assoc
        • Symbol-alistp
        • Rassoc
        • Remove-assoc
        • Remove1-assoc
        • Alist-map-vals
        • Depgraph
        • Alist-map-keys
        • Put-assoc
        • Strip-cars
        • Pairlis$
        • Strip-cdrs
        • Sublis
        • Acons
        • Eqlable-alistp
        • Assoc-string-equal
        • Alist-to-doublets
        • Character-alistp
        • String-alistp
        • Alist-keys-subsetp
        • R-symbol-alistp
        • R-eqlable-alistp
        • Pairlis
        • Pairlis-x2
        • Pairlis-x1
        • Delete-assoc
      • Set-register-invariant-risk
      • Strings
      • Program-wrapper
      • Get-internal-time
      • Basics
      • Packages
      • Oracle-eval
      • Defmacro-untouchable
      • <<
      • Primitive
      • Revert-world
      • Unmemoize
      • Set-duplicate-keys-action
      • Symbols
      • Def-list-constructor
      • Easy-simplify-term
      • Defiteration
      • Fake-oracle-eval
      • Defopen
      • Sleep
    • Operational-semantics
    • Real
    • Start-here
    • Debugging
    • Miscellaneous
    • Output-controls
    • Macros
    • Interfacing-tools
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Omaps

Keys

Oset of the keys of an omap.

Signature

(keys map) → keys

Arguments

map — Guard (mapp map).

Returns

keys — Type (setp keys).

Definitions and Theorems

Function: keys

(defun keys (map)
  (declare (xargs :guard (mapp map)))
  (let ((__function__ 'keys))
    (declare (ignorable __function__))
    (cond ((emptyp map) nil)
          (t (mv-let (key val)
                     (head map)
               (declare (ignore val))
               (insert key (keys (tail map))))))))

Theorem: setp-of-keys

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

Theorem: keys-of-mfix

(defthm keys-of-mfix
  (equal (keys (mfix map)) (keys map)))

Theorem: keys-when-emptyp

(defthm keys-when-emptyp
  (implies (emptyp map)
           (equal (keys map) nil))
  :rule-classes (:rewrite :type-prescription))

Theorem: keys-iff-not-emptyp

(defthm keys-iff-not-emptyp
  (iff (keys map) (not (emptyp map))))

Theorem: consp-of-assoc-to-in-of-keys

(defthm consp-of-assoc-to-in-of-keys
  (equal (consp (assoc key map))
         (set::in key (keys map))))

Theorem: assoc-to-in-of-keys

(defthm assoc-to-in-of-keys
  (iff (assoc key map)
       (set::in key (keys map))))

Theorem: in-of-keys-to-assoc

(defthm in-of-keys-to-assoc
  (iff (set::in key (keys map))
       (assoc key map)))

Theorem: in-keys-when-assoc-forward

(defthm in-keys-when-assoc-forward
  (implies (assoc key map)
           (set::in key (keys map)))
  :rule-classes :forward-chaining)

Theorem: in-keys-when-assoc-is-cons

(defthm in-keys-when-assoc-is-cons
  (implies (equal (assoc a m) (cons a b))
           (set::in a (keys m))))

Theorem: keys-of-update

(defthm keys-of-update
  (equal (keys (update key val m))
         (insert key (keys m))))

Theorem: keys-of-update*

(defthm keys-of-update*
  (equal (keys (update* new old))
         (union (keys new) (keys old))))

Theorem: keys-of-restrict

(defthm keys-of-restrict
  (equal (keys (restrict keys map))
         (intersect keys (keys map))))

Theorem: head-key-not-in-keys-of-tail

(defthm head-key-not-in-keys-of-tail
  (not (set::in (mv-nth 0 (head map))
                (keys (tail map)))))