• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
        • Deftreeops
          • Deftreeops-implementation
            • Deftreeops-event-generation
            • Deftreeops-info
              • Deftreeops-rulename-info
                • Deftreeops-rulename-info-fix
                • Make-deftreeops-rulename-info
                • Deftreeops-rulename-info-equiv
                • Deftreeops-rulename-infop
                  • Deftreeops-rulename-info->conc-equivs-thm
                  • Deftreeops-rulename-info->rulename-thm
                  • Deftreeops-rulename-info->nonleaf-thm
                  • Deftreeops-rulename-info->conc-infos
                  • Deftreeops-rulename-info->check-conc-fn
                  • Change-deftreeops-rulename-info
                  • Deftreeops-rulename-info->match-thm
                  • Deftreeops-rulename-info->concs-thm
                  • Deftreeops-rulename-info->alt-kind
                  • Deftreeops-rulename-info->alt
                • Deftreeops-conc-info
                • Deftreeops-rep-info
                • Deftreeops-numrange-info
                • Deftreeops-charval-info
                • Deftreeops-rep-info-list
                • Deftreeops-conc-info-list
                • Deftreeops-charval-info-alist
                • Deftreeops-rulename-info-alist
                • Deftreeops-numrange-info-alist
              • Deftreeops-process-inputs-and-gen-everything
              • Deftreeops-fn
              • Deftreeops-table
              • Deftreeops-input-processing
              • Deftreeops-macro-definition
            • Deftreeops-show-event
            • Deftreeops-show-info
          • Defdefparse
          • Defgrammar
          • Tree-utilities
          • Notation
          • 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
    • Deftreeops-rulename-info

    Deftreeops-rulename-infop

    Recognizer for deftreeops-rulename-info structures.

    Signature
    (deftreeops-rulename-infop x) → *

    Definitions and Theorems

    Function: deftreeops-rulename-infop

    (defun deftreeops-rulename-infop (x)
     (declare (xargs :guard t))
     (let ((__function__ 'deftreeops-rulename-infop))
      (declare (ignorable __function__))
      (and
       (mbe
           :logic (and (alistp x)
                       (equal (strip-cars x)
                              '(alt nonleaf-thm rulename-thm
                                    match-thm concs-thm conc-equivs-thm
                                    alt-kind check-conc-fn conc-infos)))
           :exec (fty::alist-with-carsp
                      x
                      '(alt nonleaf-thm rulename-thm
                            match-thm concs-thm conc-equivs-thm
                            alt-kind check-conc-fn conc-infos)))
       (b* ((alt (cdr (std::da-nth 0 x)))
            (nonleaf-thm (cdr (std::da-nth 1 x)))
            (rulename-thm (cdr (std::da-nth 2 x)))
            (match-thm (cdr (std::da-nth 3 x)))
            (concs-thm (cdr (std::da-nth 4 x)))
            (conc-equivs-thm (cdr (std::da-nth 5 x)))
            (alt-kind (cdr (std::da-nth 6 x)))
            (check-conc-fn (cdr (std::da-nth 7 x)))
            (conc-infos (cdr (std::da-nth 8 x))))
         (and (alternationp alt)
              (common-lisp::symbolp nonleaf-thm)
              (common-lisp::symbolp rulename-thm)
              (common-lisp::symbolp match-thm)
              (common-lisp::symbolp concs-thm)
              (common-lisp::symbolp conc-equivs-thm)
              (natp alt-kind)
              (common-lisp::symbolp check-conc-fn)
              (deftreeops-conc-info-listp conc-infos))))))

    Theorem: consp-when-deftreeops-rulename-infop

    (defthm consp-when-deftreeops-rulename-infop
      (implies (deftreeops-rulename-infop x)
               (consp x))
      :rule-classes :compound-recognizer)