proposition: Lemma euttG_base: forall rH rL gL gH t1 t2, rH t1 t2 \/ rL t1 t2 -> euttG rH rL gL gH t1 t2.
proof: Proof. intros. econstructor. gbase. destruct H; eauto using transU_id. Qed.
imports: Coq(Setoid Morphisms Relations) Paco(paco) ITree(Basics.Utils Core.ITreeDefinition Eq.Eqit Eq.Paco2 Eq.Shallow)