fact: Definition eq_existsT (A : Type) (B : A -> Type) (a a' : A) (b : B a) (b' : B a') (ea : a = a') (eb : match ea in _ = a' return B a' with eq_refl => b end = b') : existT B a b = existT B a' b' := match ea as ea in _ = a' return forall b' : B a', match ea in _ = a' return B a' with eq_refl => b end = b' -> existT B a b = existT B a' b' with | eq_refl => fun b' eb => match eb with eq_refl => eq_refl (existT B a b) end end b' eb.
imports: Coq.Init.Notations tactics Peano Basics Bool Arith Arith.EqNat Omega