proposition: Lemma pardot a b of is_test a & is_test b : a ∥ b ≡ a·b.
proof: Proof. by rewrite -{2}(@tstpar1 b) (parC _ 1) tstpar dotx1. Qed.
imports: HB(structures) Coq(Setoid Morphisms) mathcomp(all_ssreflect) GraphTheory(edone preliminaries setoid_bigop structures)