(* Bounded Universal Quantification *)
Definition AllBnd (T:pred world) (X:pred world -> pred world)
:= ALL tau:pred world, !!(TT |-- tau >=> T) --> X tau.

(* Unbounded allps *)
Lemma T_UnivI : forall G e (X:pred world -> pred world),
openValue e ->
(forall tau, Typ G e (X tau)) ->
Typ G e (allp X).