• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
      • Acre-internals
        • Regex
        • Match-string-at
        • Matchstatelist-measure
        • Parse-primitive
        • Matches-remove-zero-length
        • Parse-repeatop
        • Parse-repeatbase
        • Matchstatelist-in-bounds
        • Parse-range
        • Parse-charset-set
        • Parse-charset-atom
        • Match-regex-locs
        • Parse-octal-charcode
        • Parse-k-backref
        • Parse-g-backref
        • Matchstatelist-all-have-backref
        • Parse-repeatmod
        • Parse-charset-elem
        • Parse-charset-aux
        • Parse-hex-charcode
        • Parse-charset
        • Matchstatelist-indices-lte
        • Matchstatelist-indices-gte
        • Match-exact
        • Matches-add-backref
        • Matchresult
        • Preproc-legible-aux
        • Maybe-backref
        • Match-charset
        • Undup-equiv
        • Find-substr
        • Maybe-backref-extract-substr
        • Matchstatelist-min-index
        • Matchstate-in-bounds
        • Match-add-backref
        • Undup
        • Backref-alist-in-bounds
        • Backref
        • Matchstate
        • Matchresult->matched-substr
        • Matchresult->captured-substr!
        • Matchresult->captured-substr
        • Maybe-backref-in-bounds
        • Matchmode
        • Backref-extract-substr
        • Charset-range
        • Matchstate-measure
        • Backref-in-bounds
        • Rev-keys
        • Parse-regex
        • Undup-exec
        • Get-charset
        • Regex-concat2
        • Preproc-legible
        • Matchresult-in-bounds
        • Regex-disjunct2
        • Backref-alist
        • Named-captures-bindings
        • Captures-bindings
        • Matchstatelist
        • Charset-char-regex
        • Repeatmod-p
      • Parse-and-match-regex
      • Match-regex
      • Parse
      • Matchresult->matchedp
      • Match
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Aleobft
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • C
    • Java
    • Taspi
    • Bitcoin
    • Bigmem-asymmetric
    • Des
    • Ethereum
    • Bigmem
    • Sha-2
    • Yul
    • X86isa
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Builtins
    • Axe
    • Execloader
    • Solidity
    • Leo
    • Paco
    • Concurrent-programs
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Acre-internals

Matchstatelist-indices-gte

Signature

(matchstatelist-indices-gte n x) → gte

Arguments

n — Guard (natp n).

x — Guard (matchstatelist-p x).

Definitions and Theorems

Function: matchstatelist-indices-gte

(defun matchstatelist-indices-gte (n x)
  (declare (xargs :guard (and (natp n) (matchstatelist-p x))))
  (let ((__function__ 'matchstatelist-indices-gte))
    (declare (ignorable __function__))
    (if (atom x)
        t
      (and (<= (lnfix n)
               (matchstate->index (car x)))
           (matchstatelist-indices-gte n (cdr x))))))

Theorem: matchstatelist-indices-gte-implies-car

(defthm matchstatelist-indices-gte-implies-car
  (b* ((?gte (matchstatelist-indices-gte n x)))
    (implies (and gte (consp x))
             (<= (nfix n)
                 (matchstate->index (car x)))))
  :rule-classes :linear)

Theorem: matchstatelist-indices-gte-implies-cdr

(defthm matchstatelist-indices-gte-implies-cdr
  (b* ((?gte (matchstatelist-indices-gte n x)))
    (implies gte
             (matchstatelist-indices-gte n (cdr x)))))

Theorem: matchstatelist-indices-gte-of-append

(defthm matchstatelist-indices-gte-of-append
  (iff (matchstatelist-indices-gte n (append x y))
       (and (matchstatelist-indices-gte n x)
            (matchstatelist-indices-gte n y))))

Theorem: matchstatelist-indices-gte-of-rev

(defthm matchstatelist-indices-gte-of-rev
  (iff (matchstatelist-indices-gte n (rev x))
       (matchstatelist-indices-gte n x)))

Theorem: matchstatelist-indices-gte-of-nil

(defthm matchstatelist-indices-gte-of-nil
  (matchstatelist-indices-gte n nil))

Theorem: matchstatelist-indices-gte-of-remove

(defthm matchstatelist-indices-gte-of-remove
  (implies (matchstatelist-indices-gte n x)
           (matchstatelist-indices-gte n (remove k x))))

Theorem: matchstatelist-indices-gte-of-undup

(defthm matchstatelist-indices-gte-of-undup
  (implies (matchstatelist-indices-gte n x)
           (matchstatelist-indices-gte n (undup x))))

Theorem: matchstatelist-indices-gte-of-set-difference

(defthm matchstatelist-indices-gte-of-set-difference
  (implies (matchstatelist-indices-gte n x)
           (matchstatelist-indices-gte n (set-difference$ x y))))

Theorem: matchstatelist-indices-gte-of-nfix-n

(defthm matchstatelist-indices-gte-of-nfix-n
  (equal (matchstatelist-indices-gte (nfix n) x)
         (matchstatelist-indices-gte n x)))

Theorem: matchstatelist-indices-gte-nat-equiv-congruence-on-n

(defthm matchstatelist-indices-gte-nat-equiv-congruence-on-n
  (implies (acl2::nat-equiv n n-equiv)
           (equal (matchstatelist-indices-gte n x)
                  (matchstatelist-indices-gte n-equiv x)))
  :rule-classes :congruence)

Theorem: matchstatelist-indices-gte-of-matchstatelist-fix-x

(defthm matchstatelist-indices-gte-of-matchstatelist-fix-x
  (equal (matchstatelist-indices-gte n (matchstatelist-fix x))
         (matchstatelist-indices-gte n x)))

Theorem: matchstatelist-indices-gte-matchstatelist-equiv-congruence-on-x

(defthm
    matchstatelist-indices-gte-matchstatelist-equiv-congruence-on-x
  (implies (matchstatelist-equiv x x-equiv)
           (equal (matchstatelist-indices-gte n x)
                  (matchstatelist-indices-gte n x-equiv)))
  :rule-classes :congruence)