fact: Definition Fun {sort} {A : Type} : forall {F : A -> stype_of sort}, (forall a, selem_of (F a)) -> selem_of (ForAll F) := match sort as sort' return forall {F : A -> stype_of sort'}, (forall a, selem_of (F a)) -> selem_of (ForAll F) with | Propₛ => fun _ f => f | Typeₛ => fun _ f => f end.