proposition: Lemma transpose_eq {A: Type} : † (@eq A) ≡ (@eq A).
proof: Proof. split; unfold transpose; intros!; subst; auto. Qed.
imports: Coq(Morphisms Setoid Relation_Definitions RelationClasses ) ITree(Basics.Utils Indexed.Sum)