Sometimes I have a goal of the form “P = Q” where P and Q are terms that are the same except for the order of the arguments of a symmetric relation, e.g. (in this case equality): “a = b ∧ x = z ⇔ b = a ∧ x = z”.
Can these sub-terms be normalized by SIMP_TAC analogous to how it can normalize associative and commutative functions?. Thanks. -- Do not eat animals; respect them as you respect people. https://duckduckgo.com/?q=how+to+(become+OR+eat)+vegan
signature.asc
Description: OpenPGP digital signature
------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________ hol-info mailing list hol-info@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/hol-info
