• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
        • Deftreeops
        • Defdefparse
        • Defgrammar
        • Tree-utilities
        • Notation
          • Syntax-abstraction
          • Semantics
          • Abstract-syntax
            • Convenience-constructors
            • Num-val
            • Char-val
            • Repeat-range
            • Rulename
            • Rule
            • Rulename-option
            • Num-base
            • Rule-option
            • Prose-val
            • Rulelist
            • Char-val-set
            • Rulename-set
              • Rulename-sfix
              • Rulename-setp
                • Rulename-sequiv
              • Rulename-list
              • Grammar
              • Alt/conc/rep/elem
            • Core-rules
            • Concrete-syntax
          • Grammar-parser
          • Meta-circular-validation
          • Parsing-primitives-defresult
          • Parsing-primitives-seq
          • Operations
          • Examples
          • Differences-with-paper
          • Constructor-utilities
          • Grammar-printer
          • Parsing-tools
        • Vwsim
        • Isar
        • Wp-gen
        • Dimacs-reader
        • Pfcs
        • Legacy-defrstobj
        • Proof-checker-array
        • Soft
        • C
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Riscv
        • Des
        • Ethereum
        • X86isa
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Poseidon
        • Where-do-i-place-my-book
        • Axe
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Rulename-set

    Rulename-setp

    Recognizer for rulename-set.

    Signature
    (rulename-setp x) → *

    Definitions and Theorems

    Function: rulename-setp

    (defun rulename-setp (x)
      (declare (xargs :guard t))
      (if (atom x)
          (null x)
        (and (rulenamep (car x))
             (or (null (cdr x))
                 (and (consp (cdr x))
                      (acl2::fast-<< (car x) (cadr x))
                      (rulename-setp (cdr x)))))))

    Theorem: booleanp-ofrulename-setp

    (defthm booleanp-ofrulename-setp
      (booleanp (rulename-setp x)))

    Theorem: setp-when-rulename-setp

    (defthm setp-when-rulename-setp
      (implies (rulename-setp x) (setp x))
      :rule-classes (:rewrite))

    Theorem: rulenamep-of-head-when-rulename-setp

    (defthm rulenamep-of-head-when-rulename-setp
      (implies (rulename-setp x)
               (equal (rulenamep (head x))
                      (not (emptyp x)))))

    Theorem: rulename-setp-of-tail-when-rulename-setp

    (defthm rulename-setp-of-tail-when-rulename-setp
      (implies (rulename-setp x)
               (rulename-setp (tail x))))

    Theorem: rulename-setp-of-insert

    (defthm rulename-setp-of-insert
      (equal (rulename-setp (insert a x))
             (and (rulenamep a)
                  (rulename-setp (sfix x)))))

    Theorem: rulenamep-when-in-rulename-setp-binds-free-x

    (defthm rulenamep-when-in-rulename-setp-binds-free-x
      (implies (and (in a x) (rulename-setp x))
               (rulenamep a)))

    Theorem: not-in-rulename-setp-when-not-rulenamep

    (defthm not-in-rulename-setp-when-not-rulenamep
      (implies (and (rulename-setp x)
                    (not (rulenamep a)))
               (not (in a x))))

    Theorem: rulename-setp-of-union

    (defthm rulename-setp-of-union
      (equal (rulename-setp (union x y))
             (and (rulename-setp (sfix x))
                  (rulename-setp (sfix y)))))

    Theorem: rulename-setp-of-intersect

    (defthm rulename-setp-of-intersect
      (implies (and (rulename-setp x)
                    (rulename-setp y))
               (rulename-setp (intersect x y))))

    Theorem: rulename-setp-of-difference

    (defthm rulename-setp-of-difference
      (implies (rulename-setp x)
               (rulename-setp (difference x y))))

    Theorem: rulename-setp-of-delete

    (defthm rulename-setp-of-delete
      (implies (rulename-setp x)
               (rulename-setp (delete a x))))