• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
      • Deftreeops
      • Defdefparse
      • Defgrammar
      • Tree-utilities
      • Notation
      • Grammar-parser
      • Meta-circular-validation
      • Parsing-primitives-defresult
      • Parsing-primitives-seq
      • Operations
        • In-terminal-set
        • Well-formedness
        • Closure
        • Plugging
        • Ambiguity
        • Renaming
        • Numeric-range-retrieval
          • Num-range
            • Num-range-fix
            • Num-range-equiv
            • Make-num-range
            • Change-num-range
            • Num-range->min
            • Num-range->max
            • Num-range->base
            • Num-range-p
          • Num-val-num-ranges
          • Rulelist-num-ranges
          • Rule-num-ranges
          • Element-num-ranges
          • Num-range-set
          • Alternation-num-ranges
          • Concatenation-num-ranges
          • Repetition-num-ranges
        • Rule-utilities
        • Removal
        • Character-value-retrieval
      • 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

• Num-range

Num-range-equiv

Basic equivalence relation for num-range structures.

Definitions and Theorems

Function: num-range-equiv$inline

(defun num-range-equiv$inline (acl2::x acl2::y)
  (declare (xargs :guard (and (num-range-p acl2::x)
                              (num-range-p acl2::y))))
  (equal (num-range-fix acl2::x)
         (num-range-fix acl2::y)))

Theorem: num-range-equiv-is-an-equivalence

(defthm num-range-equiv-is-an-equivalence
  (and (booleanp (num-range-equiv x y))
       (num-range-equiv x x)
       (implies (num-range-equiv x y)
                (num-range-equiv y x))
       (implies (and (num-range-equiv x y)
                     (num-range-equiv y z))
                (num-range-equiv x z)))
  :rule-classes (:equivalence))

Theorem: num-range-equiv-implies-equal-num-range-fix-1

(defthm num-range-equiv-implies-equal-num-range-fix-1
  (implies (num-range-equiv acl2::x x-equiv)
           (equal (num-range-fix acl2::x)
                  (num-range-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: num-range-fix-under-num-range-equiv

(defthm num-range-fix-under-num-range-equiv
  (num-range-equiv (num-range-fix acl2::x)
                   acl2::x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-num-range-fix-1-forward-to-num-range-equiv

(defthm equal-of-num-range-fix-1-forward-to-num-range-equiv
  (implies (equal (num-range-fix acl2::x) acl2::y)
           (num-range-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: equal-of-num-range-fix-2-forward-to-num-range-equiv

(defthm equal-of-num-range-fix-2-forward-to-num-range-equiv
  (implies (equal acl2::x (num-range-fix acl2::y))
           (num-range-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: num-range-equiv-of-num-range-fix-1-forward

(defthm num-range-equiv-of-num-range-fix-1-forward
  (implies (num-range-equiv (num-range-fix acl2::x)
                            acl2::y)
           (num-range-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: num-range-equiv-of-num-range-fix-2-forward

(defthm num-range-equiv-of-num-range-fix-2-forward
  (implies (num-range-equiv acl2::x (num-range-fix acl2::y))
           (num-range-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)