• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
        • Warnings
        • Primitives
        • Use-set
        • Syntax
        • Getting-started
        • Utilities
        • Loader
        • Transforms
        • Lint
        • Mlib
        • Server
        • Kit
        • Printer
          • Ps
          • Basic-printing
          • Verilog-printing
            • Vl-fmt
            • Vl-ppc-module
            • Vl-pp-expr
            • Vl-maybe-escape-identifier
              • Vl-simple-id-tail-string-p
              • Vl-print-ext-wirename
              • Vl-pp-module
              • Vl-print-wirename
              • Vl-print-loc
              • Vl-print-modname
              • Vl-pp-origexpr
              • Vl-pps-module
              • Vl-pps-expr
              • Vl-ppc-modulelist
              • Vl-ppcs-module
              • Vl-ps-update-show-atts
              • Vl-pps-origexpr
              • Vl-pps-modulelist
              • Vl-ppcs-modulelist
              • Vl-cw-obj
              • Vl-ps->show-atts-p
              • Vl-cw
            • Printing-locally
            • Formatted-printing
            • Accessing-printed-output
            • Vl-printedlist
            • Json-printing
          • Esim-vl
          • Well-formedness
        • Sv
        • Fgl
        • Vwsim
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Vl-maybe-escape-identifier

    Vl-simple-id-tail-string-p

    Signature
    (vl-simple-id-tail-string-p x i len) → *
    Arguments
    x — Guard (stringp x).
    i — Guard (natp i).
    len — Guard (eql len (length x)).

    Definitions and Theorems

    Function: vl-simple-id-tail-string-p

    (defun vl-simple-id-tail-string-p (x i len)
      (declare (xargs :guard (and (stringp x)
                                  (natp i)
                                  (eql len (length x)))))
      (declare (xargs :guard (<= i len)))
      (let ((__function__ 'vl-simple-id-tail-string-p))
        (declare (ignorable __function__))
        (if (mbe :logic (zp (- (nfix len) (nfix i)))
                 :exec (eql i len))
            t
          (and (vl-simple-id-tail-p (char x i))
               (vl-simple-id-tail-string-p x (+ 1 (lnfix i))
                                           len)))))

    Theorem: vl-simple-id-tail-string-p-of-str-fix-x

    (defthm vl-simple-id-tail-string-p-of-str-fix-x
      (equal (vl-simple-id-tail-string-p (str-fix x)
                                         i len)
             (vl-simple-id-tail-string-p x i len)))

    Theorem: vl-simple-id-tail-string-p-streqv-congruence-on-x

    (defthm vl-simple-id-tail-string-p-streqv-congruence-on-x
      (implies (streqv x x-equiv)
               (equal (vl-simple-id-tail-string-p x i len)
                      (vl-simple-id-tail-string-p x-equiv i len)))
      :rule-classes :congruence)

    Theorem: vl-simple-id-tail-string-p-of-nfix-i

    (defthm vl-simple-id-tail-string-p-of-nfix-i
      (equal (vl-simple-id-tail-string-p x (nfix i)
                                         len)
             (vl-simple-id-tail-string-p x i len)))

    Theorem: vl-simple-id-tail-string-p-nat-equiv-congruence-on-i

    (defthm vl-simple-id-tail-string-p-nat-equiv-congruence-on-i
      (implies (acl2::nat-equiv i i-equiv)
               (equal (vl-simple-id-tail-string-p x i len)
                      (vl-simple-id-tail-string-p x i-equiv len)))
      :rule-classes :congruence)