• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
    • Std/lists
    • Omaps
    • Std/alists
    • Obags
    • Std/util
    • Std/strings
      • Pretty-printing
      • Printtree
      • Base64
      • Charset-p
      • Strtok!
      • Cases
      • Concatenation
      • Character-kinds
        • Letter/digit/uscore/dollar-char-p
        • Letter/digit/uscore/dash-char-p
        • Letter/uscore/dollar-char-p
        • Letter/digit/uscore-char-p
        • Letter/digit/dash-char-p
        • Letter-char-p
        • Letter/uscore-char-p
        • Letter/digit-char-p
          • Letter/digit-charlist-p
            • Letter/digit-charlist-p-basics
          • Letter/digit-chars
        • Lcletter/digit-char-p
        • Ucletter/digit-char-p
        • Printable-char-p
        • Nondigit-char-p
        • Ucletter-char-p
        • Lcletter-char-p
        • Ascii-char-p
      • Html-encoding
      • Substrings
      • Strtok
      • Equivalences
      • Url-encoding
      • Lines
      • Explode-implode-equalities
      • Ordering
      • Numbers
      • Pad-trim
      • Coercion
      • Std/strings/digit-to-char
      • Substitution
      • Symbols
    • Std/osets
    • Std/io
    • Std/basic
    • Std/system
    • Std/typed-lists
    • Std/bitsets
    • Std/testing
    • Std/typed-alists
    • Std/stobjs
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Letter/digit-charlist-p

Letter/digit-charlist-p-basics

Basic theorems about letter/digit-charlist-p, generated by std::deflist.

Definitions and Theorems

Theorem: letter/digit-charlist-p-of-cons

(defthm letter/digit-charlist-p-of-cons
  (equal (letter/digit-charlist-p (cons a x))
         (and (letter/digit-char-p a)
              (letter/digit-charlist-p x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-cdr-when-letter/digit-charlist-p

(defthm letter/digit-charlist-p-of-cdr-when-letter/digit-charlist-p
  (implies (letter/digit-charlist-p (double-rewrite x))
           (letter/digit-charlist-p (cdr x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-when-not-consp

(defthm letter/digit-charlist-p-when-not-consp
  (implies (not (consp x))
           (letter/digit-charlist-p x))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-char-p-of-car-when-letter/digit-charlist-p

(defthm letter/digit-char-p-of-car-when-letter/digit-charlist-p
  (implies (letter/digit-charlist-p x)
           (iff (letter/digit-char-p (car x))
                (or (consp x)
                    (letter/digit-char-p nil))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-append

(defthm letter/digit-charlist-p-of-append
  (equal (letter/digit-charlist-p (append a b))
         (and (letter/digit-charlist-p a)
              (letter/digit-charlist-p b)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-list-fix

(defthm letter/digit-charlist-p-of-list-fix
  (equal (letter/digit-charlist-p (list-fix x))
         (letter/digit-charlist-p x))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-sfix

(defthm letter/digit-charlist-p-of-sfix
  (iff (letter/digit-charlist-p (set::sfix x))
       (or (letter/digit-charlist-p x)
           (not (set::setp x))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-insert

(defthm letter/digit-charlist-p-of-insert
  (iff (letter/digit-charlist-p (set::insert a x))
       (and (letter/digit-charlist-p (set::sfix x))
            (letter/digit-char-p a)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-delete

(defthm letter/digit-charlist-p-of-delete
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (set::delete k x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-mergesort

(defthm letter/digit-charlist-p-of-mergesort
  (iff (letter/digit-charlist-p (set::mergesort x))
       (letter/digit-charlist-p (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-union

(defthm letter/digit-charlist-p-of-union
  (iff (letter/digit-charlist-p (set::union x y))
       (and (letter/digit-charlist-p (set::sfix x))
            (letter/digit-charlist-p (set::sfix y))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-intersect-1

(defthm letter/digit-charlist-p-of-intersect-1
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-intersect-2

(defthm letter/digit-charlist-p-of-intersect-2
  (implies (letter/digit-charlist-p y)
           (letter/digit-charlist-p (set::intersect x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-difference

(defthm letter/digit-charlist-p-of-difference
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (set::difference x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-duplicated-members

(defthm letter/digit-charlist-p-of-duplicated-members
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (acl2::duplicated-members x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-rev

(defthm letter/digit-charlist-p-of-rev
  (equal (letter/digit-charlist-p (rev x))
         (letter/digit-charlist-p (list-fix x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-rcons

(defthm letter/digit-charlist-p-of-rcons
  (iff (letter/digit-charlist-p (acl2::rcons a x))
       (and (letter/digit-char-p a)
            (letter/digit-charlist-p (list-fix x))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-char-p-when-member-equal-of-letter/digit-charlist-p

(defthm
   letter/digit-char-p-when-member-equal-of-letter/digit-charlist-p
  (and (implies (and (member-equal a x)
                     (letter/digit-charlist-p x))
                (letter/digit-char-p a))
       (implies (and (letter/digit-charlist-p x)
                     (member-equal a x))
                (letter/digit-char-p a)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-when-subsetp-equal

(defthm letter/digit-charlist-p-when-subsetp-equal
  (and (implies (and (subsetp-equal x y)
                     (letter/digit-charlist-p y))
                (letter/digit-charlist-p x))
       (implies (and (letter/digit-charlist-p y)
                     (subsetp-equal x y))
                (letter/digit-charlist-p x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-set-equiv-congruence

(defthm letter/digit-charlist-p-set-equiv-congruence
  (implies (acl2::set-equiv x y)
           (equal (letter/digit-charlist-p x)
                  (letter/digit-charlist-p y)))
  :rule-classes :congruence)

Theorem: letter/digit-charlist-p-of-set-difference-equal

(defthm letter/digit-charlist-p-of-set-difference-equal
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (set-difference-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-intersection-equal-1

(defthm letter/digit-charlist-p-of-intersection-equal-1
  (implies (letter/digit-charlist-p (double-rewrite x))
           (letter/digit-charlist-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-intersection-equal-2

(defthm letter/digit-charlist-p-of-intersection-equal-2
  (implies (letter/digit-charlist-p (double-rewrite y))
           (letter/digit-charlist-p (intersection-equal x y)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-union-equal

(defthm letter/digit-charlist-p-of-union-equal
  (equal (letter/digit-charlist-p (union-equal x y))
         (and (letter/digit-charlist-p (list-fix x))
              (letter/digit-charlist-p (double-rewrite y))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-take

(defthm letter/digit-charlist-p-of-take
  (implies (letter/digit-charlist-p (double-rewrite x))
           (iff (letter/digit-charlist-p (take n x))
                (or (letter/digit-char-p nil)
                    (<= (nfix n) (len x)))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-repeat

(defthm letter/digit-charlist-p-of-repeat
  (iff (letter/digit-charlist-p (repeat n x))
       (or (letter/digit-char-p x) (zp n)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-char-p-of-nth-when-letter/digit-charlist-p

(defthm letter/digit-char-p-of-nth-when-letter/digit-charlist-p
  (implies (and (letter/digit-charlist-p x)
                (< (nfix n) (len x)))
           (letter/digit-char-p (nth n x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-update-nth

(defthm letter/digit-charlist-p-of-update-nth
  (implies (letter/digit-charlist-p (double-rewrite x))
           (iff (letter/digit-charlist-p (update-nth n y x))
                (and (letter/digit-char-p y)
                     (or (<= (nfix n) (len x))
                         (letter/digit-char-p nil)))))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-butlast

(defthm letter/digit-charlist-p-of-butlast
  (implies (letter/digit-charlist-p (double-rewrite x))
           (letter/digit-charlist-p (butlast x n)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-nthcdr

(defthm letter/digit-charlist-p-of-nthcdr
  (implies (letter/digit-charlist-p (double-rewrite x))
           (letter/digit-charlist-p (nthcdr n x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-last

(defthm letter/digit-charlist-p-of-last
  (implies (letter/digit-charlist-p (double-rewrite x))
           (letter/digit-charlist-p (last x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-remove

(defthm letter/digit-charlist-p-of-remove
  (implies (letter/digit-charlist-p x)
           (letter/digit-charlist-p (remove a x)))
  :rule-classes ((:rewrite)))

Theorem: letter/digit-charlist-p-of-revappend

(defthm letter/digit-charlist-p-of-revappend
  (equal (letter/digit-charlist-p (revappend x y))
         (and (letter/digit-charlist-p (list-fix x))
              (letter/digit-charlist-p y)))
  :rule-classes ((:rewrite)))