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