proposition: Lemma critical_pair3 (u u' a b : tm) of is_test a & is_test b : dom (u'·(dom (u·a)·b)) ≡ dom (u'·b·u·a).
proof: Proof. by rewrite dotC /= dotA -A13 !dotA. Qed.
imports: HB(structures) Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom rewriting) GraphTheory(finmap_plus)