Fixing function for deftreeops-conc-info structures.
(deftreeops-conc-info-fix x) → new-x
Function:
(defun deftreeops-conc-info-fix$inline (x) (declare (xargs :guard (deftreeops-conc-infop x))) (let ((__function__ 'deftreeops-conc-info-fix)) (declare (ignorable __function__)) (mbe :logic (b* ((conc (concatenation-fix (cdr (std::da-nth 0 x)))) (discriminant-term (cdr (std::da-nth 1 x))) (matching-thm (acl2::symbol-fix (cdr (std::da-nth 2 x)))) (check-conc-fn-equiv-thm (acl2::symbol-fix (cdr (std::da-nth 3 x)))) (get-tree-list-list-fn (acl2::symbol-fix (cdr (std::da-nth 4 x)))) (rep-infos (deftreeops-rep-info-list-fix (cdr (std::da-nth 5 x))))) (list (cons 'conc conc) (cons 'discriminant-term discriminant-term) (cons 'matching-thm matching-thm) (cons 'check-conc-fn-equiv-thm check-conc-fn-equiv-thm) (cons 'get-tree-list-list-fn get-tree-list-list-fn) (cons 'rep-infos rep-infos))) :exec x)))
Theorem:
(defthm deftreeops-conc-infop-of-deftreeops-conc-info-fix (b* ((new-x (deftreeops-conc-info-fix$inline x))) (deftreeops-conc-infop new-x)) :rule-classes :rewrite)
Theorem:
(defthm deftreeops-conc-info-fix-when-deftreeops-conc-infop (implies (deftreeops-conc-infop x) (equal (deftreeops-conc-info-fix x) x)))
Function:
(defun deftreeops-conc-info-equiv$inline (acl2::x acl2::y) (declare (xargs :guard (and (deftreeops-conc-infop acl2::x) (deftreeops-conc-infop acl2::y)))) (equal (deftreeops-conc-info-fix acl2::x) (deftreeops-conc-info-fix acl2::y)))
Theorem:
(defthm deftreeops-conc-info-equiv-is-an-equivalence (and (booleanp (deftreeops-conc-info-equiv x y)) (deftreeops-conc-info-equiv x x) (implies (deftreeops-conc-info-equiv x y) (deftreeops-conc-info-equiv y x)) (implies (and (deftreeops-conc-info-equiv x y) (deftreeops-conc-info-equiv y z)) (deftreeops-conc-info-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm deftreeops-conc-info-equiv-implies-equal-deftreeops-conc-info-fix-1 (implies (deftreeops-conc-info-equiv acl2::x x-equiv) (equal (deftreeops-conc-info-fix acl2::x) (deftreeops-conc-info-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm deftreeops-conc-info-fix-under-deftreeops-conc-info-equiv (deftreeops-conc-info-equiv (deftreeops-conc-info-fix acl2::x) acl2::x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-deftreeops-conc-info-fix-1-forward-to-deftreeops-conc-info-equiv (implies (equal (deftreeops-conc-info-fix acl2::x) acl2::y) (deftreeops-conc-info-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-deftreeops-conc-info-fix-2-forward-to-deftreeops-conc-info-equiv (implies (equal acl2::x (deftreeops-conc-info-fix acl2::y)) (deftreeops-conc-info-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm deftreeops-conc-info-equiv-of-deftreeops-conc-info-fix-1-forward (implies (deftreeops-conc-info-equiv (deftreeops-conc-info-fix acl2::x) acl2::y) (deftreeops-conc-info-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm deftreeops-conc-info-equiv-of-deftreeops-conc-info-fix-2-forward (implies (deftreeops-conc-info-equiv acl2::x (deftreeops-conc-info-fix acl2::y)) (deftreeops-conc-info-equiv acl2::x acl2::y)) :rule-classes :forward-chaining)