• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Fgl
    • Vwsim
    • Vl
      • Syntax
      • Loader
        • Preprocessor
        • Vl-loadconfig
        • Vl-loadstate
        • Lexer
          • Lex-strings
            • Vl-read-string-aux
            • Vl-read-octal-string-escape
            • Vl-read-string-escape-sequence
            • Vl-read-hex-string-escape
            • Vl-read-string
            • Vl-lex-string
              • Vl-lex-string-token/remainder-thms
          • Lex-identifiers
          • Vl-typo-uppercase-p
          • Vl-typo-number-p
          • Vl-typo-lowercase-p
          • Lex-numbers
          • Chartypes
          • Vl-lex
          • Defchar
          • Tokens
          • Lex-keywords
          • Lexstate
          • Make-test-tokens
          • Lexer-utils
          • Lex-comments
          • Vl-typo-uppercase-list-p
          • Vl-typo-lowercase-list-p
          • Vl-typo-number-list-p
        • Parser
        • Vl-load-merge-descriptions
        • Vl-find-basename/extension
        • Vl-load-file
        • Vl-loadresult
        • Scope-of-defines
        • Vl-find-file
        • Vl-flush-out-descriptions
        • Vl-description
        • Vl-read-file
        • Vl-includeskips-report-gather
        • Vl-load-main
        • Extended-characters
        • Vl-load
        • Vl-load-description
        • Vl-descriptions-left-to-load
        • Inject-warnings
        • Vl-preprocess-debug
        • Vl-write-preprocessor-debug-file
        • Vl-read-file-report-gather
        • Vl-load-descriptions
        • Vl-load-files
        • Translate-off
        • Vl-load-read-file-hook
        • Vl-read-file-report
        • Vl-loadstate-pad
        • Vl-load-summary
        • Vl-collect-modules-from-descriptions
        • Vl-loadstate->warnings
        • Vl-iskips-report
        • Vl-descriptionlist
      • Warnings
      • Getting-started
      • Utilities
      • Printer
      • Kit
      • Mlib
      • Transforms
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Vl-lex-string
• Def-token/remainder-thms

Vl-lex-string-token/remainder-thms

Token and remainder theorems for vl-lex-string, automatically generated by def-token/remainder-thms.

Definitions and Theorems

Theorem: vl-token-p-of-vl-lex-string

(defthm vl-token-p-of-vl-lex-string
 (implies
     (and (force (vl-echarlist-p echars)) t)
     (equal (vl-token-p (mv-nth 0 (vl-lex-string echars breakp st)))
            (if (mv-nth 0 (vl-lex-string echars breakp st))
                t
              nil))))

Theorem: true-listp-of-vl-lex-string

(defthm true-listp-of-vl-lex-string
 (equal (true-listp (mv-nth 1 (vl-lex-string echars breakp st)))
        (true-listp echars))
 :rule-classes
 ((:rewrite)
  (:type-prescription
   :corollary
   (implies
        (true-listp echars)
        (true-listp (mv-nth 1 (vl-lex-string echars breakp st)))))))

Theorem: vl-echarlist-p-of-vl-lex-string

(defthm vl-echarlist-p-of-vl-lex-string
 (implies
   (force (vl-echarlist-p echars))
   (equal
        (vl-echarlist-p (mv-nth 1 (vl-lex-string echars breakp st)))
        t)))

Theorem: append-of-vl-lex-string

(defthm append-of-vl-lex-string
 (implies
  (and (mv-nth 0 (vl-lex-string echars breakp st))
       (force (vl-echarlist-p echars))
       t)
  (equal
   (append
       (vl-token->etext (mv-nth 0 (vl-lex-string echars breakp st)))
       (mv-nth 1 (vl-lex-string echars breakp st)))
   echars)))

Theorem: no-change-loser-of-vl-lex-string

(defthm no-change-loser-of-vl-lex-string
  (implies (not (mv-nth 0 (vl-lex-string echars breakp st)))
           (equal (mv-nth 1 (vl-lex-string echars breakp st))
                  echars)))

Theorem: acl2-count-of-vl-lex-string-weak

(defthm acl2-count-of-vl-lex-string-weak
  (<= (acl2-count (mv-nth 1 (vl-lex-string echars breakp st)))
      (acl2-count echars))
  :rule-classes ((:rewrite) (:linear)))

Theorem: acl2-count-of-vl-lex-string-strong

(defthm acl2-count-of-vl-lex-string-strong
  (implies
       (and (mv-nth 0 (vl-lex-string echars breakp st))
            t)
       (< (acl2-count (mv-nth 1 (vl-lex-string echars breakp st)))
          (acl2-count echars)))
  :rule-classes ((:rewrite) (:linear)))