(** * Strong bisimulation is propositional equality *)
(** This is not provable but admissible as an axiom.  This axiom is not used by this library, but only exported for convenience, as it can certainly simplify some developments. *)
(* begin hide *)
Core.ITreeDefinition
Eq.Eq.
(* end hide *)

Lemma itree_eta_ {E R} (t : itree E R) : t = go (observe t).