From c6376f2fc4b8d1ff87c4f95ad4e227e7d44bca25 Mon Sep 17 00:00:00 2001
From: mohring
Date: Sun, 21 Dec 2003 15:47:28 +0000
Subject: *** empty log message ***

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8435 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 doc/RefMan-cic.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/RefMan-cic.tex b/doc/RefMan-cic.tex
index 7cc9061877..d9a94bb72d 100755
--- a/doc/RefMan-cic.tex
+++ b/doc/RefMan-cic.tex
@@ -1205,11 +1205,11 @@ The second operator for elimination is fixpoint definition.
 This fixpoint may involve several mutually recursive definitions.
 The basic concrete syntax for a recursive set of mutually recursive 
 declarations is (with $\Gamma_i$ contexts)~: 
-\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with} f_n
+\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with}~ f_n
 (\Gamma_n) :A_n:=t_n\]
 The terms are obtained by projections from this set of declarations
 and are written 
-\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with} f_n
+\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with}~ f_n
 (\Gamma_n) :A_n:=t_n~\kw{for}~f_i\]
 In the inference rules, we represent such a
 term by 
-- 
cgit v1.2.3