proposition: Lemma WeakEq_Trans: forall (av : Type) (m0 m1 m2 : StringMap.t (Value av)), WeakEq m0 m1 -> WeakEq m1 m2 -> WeakEq m0 m2.
proof: Proof. unfold WeakEq; t_Morphism; eauto using SameSCAs_Trans, SameADTs_Trans. Qed.
imports: CertifiedExtraction.HintDBs CertifiedExtraction.Core CertifiedExtraction.Utils CertifiedExtraction.StringMapUtils Coq.Setoids.Setoid