• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Community
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Apt
      • Error-checking
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Set
      • C
      • Soft
      • Bv
      • Imp-language
      • Ethereum
      • Event-macros
      • Java
        • Atj
        • Aij
        • Language
          • Syntax
            • Grammar
            • Unicode-escapes
            • Unicode-input-char
            • Escape-sequence
            • Identifiers
            • Primitive-types
            • Reference-types
            • Unicode-characters
            • Keywords
            • Integer-literals
            • String-literals
            • Octal-digits
            • Hexadecimal-digits
            • Decimal-digits
            • Binary-digits
              • Bin-digit
              • Binary-digits-grammar-validation
                • Grammar-bin-digitp
                • Bin-digitp-when-grammar-bin-digitp
                • Bin-digit-tree
                • Grammar-bin-digitp-when-bin-digitp
                • Bin-digitp-is-grammar-bin-digitp
              • Bin-digit-value
              • Bin-digit-list
              • Binary-digits-std/strings-theorems
            • Character-literals
            • Null-literal
            • Floating-point-literals
            • Boolean-literals
            • Package-names
            • Literals
          • Semantics
      • Riscv
      • Bitcoin
      • Zcash
      • Yul
      • ACL2-programming-language
      • Prime-fields
      • Json
      • Syntheto
      • File-io-light
      • Cryptography
      • Number-theory
      • Axe
      • Lists-light
      • Builtins
      • Solidity
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Binary-digits-grammar-validation

Grammar-bin-digitp-when-bin-digitp

Proof of grammar-bin-digitp from bin-digitp.

This is proved using bin-digit-tree as witness for the existential quantification: if x is a binary digit then we can use its tree as witness, since its leaves are the binary digit x as well.

Definitions and Theorems

Theorem: grammar-bin-digitp-when-bin-digitp

(defthm grammar-bin-digitp-when-bin-digitp
  (implies (bin-digitp x)
           (grammar-bin-digitp (list x))))