fact: Definition pweqeq {R1 R2} (RR : R1 -> R2 -> Prop) {X1 X2 : Type} (p : X1 = X2) : (X1 -> R1) -> (X2 -> R2) -> Prop := match p with | eq_refl => fun k1 k2 => forall x, RR (k1 x) (k2 x) end.
imports: Coq(Morphisms) ITree(Core.ITreeDefinition)