proposition: Theorem hlist_hrel_equiv : forall T (F : T -> Type) (R : forall t, F t -> F t -> Prop) ls (h h' : hlist F ls), hlist_hrel R h h' -> equiv_hlist R h h'.
proof: Proof. induction 1; constructor; auto. Qed.
imports: Coq.Lists.List Coq.Arith.PeanoNat Relations RelationClasses ExtLib.Core.RelDec ExtLib.Data.SigT ExtLib.Data.Member ExtLib.Data.ListNth ExtLib.Data.Option ExtLib.Tactics Coq.Classes.Morphisms