proposition: Lemma Term_requiv_onetype (G : ctxt) {t} (e1 : Term fnvar1 t) (e2 : Term fnvar2 t) : prop_of_option (Term_requivT (duplicate_type G) e1 e2) -> @Term_equiv var1 var2 G t (unnatize_Term (List.length G) e1) (unnatize_Term (List.length G) e2).
proof: Proof. pose proof (@Term_requiv G t t e1 e2) as H; t. Qed.
imports: Coq.Lists.List Coq.Arith.EqNat Coq.Logic.Eqdep_dec Fiat.Parsers.Reflective.Syntax Fiat.Parsers.Reflective.SyntaxEquality Fiat.Parsers.Reflective.SyntaxEquivalence Fiat.Common.PointedProp Fiat.Common.OptionFacts Fiat.Common.Prod Fiat.Common.Sigma Fiat.Common