proposition: Lemma par_tst_cnv a u of is_test a : a ∥ u° ≡ a ∥ u.
proof: Proof. by rewrite -[a∥u°]cnvtst cnvpar cnvtst cnvI. Qed.
imports: HB(structures) Coq(Setoid Morphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries setoid_bigop structures)