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