proposition: Lemma eq_dep_nd_of_eq_dep : forall (A : Type) (P : A -> Type) (p q : A) (x : P p) (y : P q), eq_dep x y -> eq_dep_nd x y.
proof: Proof. Proof using. introv H. destruct H. apply (eq_dep_nd_intro (refl_equal p)); auto. Qed.
imports: TLC(LibTactics LibAxioms)