Affichage sur le modèle du forall pour le exists

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@5125 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 5 insertions, 2 deletions

diff --git a/theories/Init/Logic.v b/theories/Init/Logic.v
index e225bbddbd..9e755c9288 100755
--- a/theories/Init/Logic.v
+++ b/theories/Init/Logic.v
@@ -121,12 +121,15 @@ Definition all (A:Type) (P:A -> Prop) := forall x:A, P x.
 Notation "'exists' x , p" := (ex (fun x => p))
   (at level 200, x ident) : type_scope.
 Notation "'exists' x : t , p" := (ex (fun x:t => p))
-  (at level 200, x ident) : type_scope.
+  (at level 200, x ident, format "'exists'  '/  ' x : t ,  '/  ' p")
+  : type_scope.
 
 Notation "'exists2' x , p & q" := (ex2 (fun x => p) (fun x => q))
   (at level 200, x ident, p at level 200) : type_scope.
 Notation "'exists2' x : t , p & q" := (ex2 (fun x:t => p) (fun x:t => q))
-  (at level 200, x ident, t at level 200, p at level 200) : type_scope.
+  (at level 200, x ident, t at level 200, p at level 200,
+   format "'exists2'  '/  ' x : t ,  '/  ' '[' p  &  '/' q ']'")
+  : type_scope.
 
 
 (** Universal quantification *)