(***********************************************************************) (* v * The Coq Proof Assistant / The Coq Development Team *) (* { p , q }" := (conj P Q p q) (P annot, at level 1). ]. Notation "~ x" := (not x) (at level 5, right associativity) V8only (at level 55, right associativity). Notation "x = y" := (eq ? x y) (at level 5, no associativity). Notation "x <> y" := (not (eq ? x y)) (at level 5, no associativity). Infix RIGHTA 6 "/\\" and. Infix RIGHTA 7 "\\/" or. Infix RIGHTA 8 "<->" iff. Notation "'IF' c1 'then' c2 'else' c3" := (IF c1 c2 c3) (at level 1, c1, c2, c3 at level 8) V8only (at level 200). (* Order is important to give printing priority to fully typed ALL and EX *) Notation All := (all ?). Notation "'ALL' x | p" := (all ? [x]p) (at level 10, p at level 8) V8only (at level 200, p at level 200). Notation "'ALL' x : t | p" := (all t [x:t]p) (at level 10, p at level 8) V8only (at level 200). Notation Ex := (ex ?). Notation "'EX' x | p" := (ex ? [x]p) (at level 10, p at level 8) V8only (at level 200, x at level 80). Notation "'EX' x : t | p" := (ex t [x:t]p) (at level 10, p at level 8) V8only (at level 200, x at level 80). Notation Ex2 := (ex2 ?). Notation "'EX' x | p & q" := (ex2 ? [x]p [x]q) (at level 10, p, q at level 8) V8only "'EX2' x | p & q" (at level 200, x at level 80). Notation "'EX' x : t | p & q" := (ex2 t [x:t]p [x:t]q) (at level 10, p, q at level 8) V8only "'EX2' x : t | p & q" (at level 200, x at level 80). (** Parsing only of things in [Logic.v] *) V7only[ Notation "< A > 'All' ( P )" := (all A P) (A annot, at level 1, only parsing). Notation "< A > x = y" := (eq A x y) (A annot, at level 1, x at level 0, only parsing). ].