(* Contribution to the Coq Library   V6.3 (July 1999)                    *)
(****************************************************************************)
(* This contribution was updated for Coq V5.10 by the COQ workgroup.        *)
(* January 1995                                                             *)
(****************************************************************************)
(*                                drinker.v                                 *)
(****************************************************************************)

Theorem drinker's_theorem :
(forall P : Prop, P \/ ~ P) ->
forall (U : Set) (x : U) (Q : U -> Prop),
exists x : U, Q x -> forall x : U, Q x.