Basic equivalence relation for maybe-fgl-generic-rune structures.
Function:
(defun maybe-fgl-generic-rune-equiv$inline (x y) (declare (xargs :guard (and (maybe-fgl-generic-rune-p x) (maybe-fgl-generic-rune-p y)))) (equal (maybe-fgl-generic-rune-fix x) (maybe-fgl-generic-rune-fix y)))
Theorem:
(defthm maybe-fgl-generic-rune-equiv-is-an-equivalence (and (booleanp (maybe-fgl-generic-rune-equiv x y)) (maybe-fgl-generic-rune-equiv x x) (implies (maybe-fgl-generic-rune-equiv x y) (maybe-fgl-generic-rune-equiv y x)) (implies (and (maybe-fgl-generic-rune-equiv x y) (maybe-fgl-generic-rune-equiv y z)) (maybe-fgl-generic-rune-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm maybe-fgl-generic-rune-equiv-implies-equal-maybe-fgl-generic-rune-fix-1 (implies (maybe-fgl-generic-rune-equiv x x-equiv) (equal (maybe-fgl-generic-rune-fix x) (maybe-fgl-generic-rune-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm maybe-fgl-generic-rune-fix-under-maybe-fgl-generic-rune-equiv (maybe-fgl-generic-rune-equiv (maybe-fgl-generic-rune-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-maybe-fgl-generic-rune-fix-1-forward-to-maybe-fgl-generic-rune-equiv (implies (equal (maybe-fgl-generic-rune-fix x) y) (maybe-fgl-generic-rune-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-maybe-fgl-generic-rune-fix-2-forward-to-maybe-fgl-generic-rune-equiv (implies (equal x (maybe-fgl-generic-rune-fix y)) (maybe-fgl-generic-rune-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm maybe-fgl-generic-rune-equiv-of-maybe-fgl-generic-rune-fix-1-forward (implies (maybe-fgl-generic-rune-equiv (maybe-fgl-generic-rune-fix x) y) (maybe-fgl-generic-rune-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm maybe-fgl-generic-rune-equiv-of-maybe-fgl-generic-rune-fix-2-forward (implies (maybe-fgl-generic-rune-equiv x (maybe-fgl-generic-rune-fix y)) (maybe-fgl-generic-rune-equiv x y)) :rule-classes :forward-chaining)