From 2e5d35bf5492ca2cfdb8f3ef1a9fccdf67289e5e Mon Sep 17 00:00:00 2001
From: notin
Date: Fri, 26 Jan 2007 16:40:03 +0000
Subject: Explication du intros until n

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9543 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 doc/refman/RefMan-tac.tex | 16 ++++++++++------
 1 file changed, 10 insertions(+), 6 deletions(-)

(limited to 'doc')

diff --git a/doc/refman/RefMan-tac.tex b/doc/refman/RefMan-tac.tex
index f62412f8fc..455dcb65a0 100644
--- a/doc/refman/RefMan-tac.tex
+++ b/doc/refman/RefMan-tac.tex
@@ -282,12 +282,16 @@ the tactic {\tt intro} applies the tactic {\tt red} until the tactic
   
 \item {\tt intros until {\num}}  \tacindex{intros until}
   
-  Repeats {\tt intro} until the {\num}-th non-dependent premise. For
-  instance, on the subgoal %
-  \verb+forall x y:nat, x=y -> forall z:nat,z=x->z=y+ the
-  tactic \texttt{intros until 2} is equivalent to \texttt{intros x y H
-    z H0} (assuming \texttt{x, y, H, z} and \texttt{H0} do not already
-  occur in context).
+  Repeats {\tt intro} until the {\num}-th non-dependent product. For
+  instance, on the subgoal % 
+  \verb+forall x y:nat, x=y -> y=x+ the tactic \texttt{intros until 1}
+  is equivalent to \texttt{intros x y H}, as \verb+x=y -> y=x+ is the
+  first non-dependent product. And on the subgoal %
+  \verb+forall x y z:nat, x=y -> y=x+ the tactic \texttt{intros until 1}
+  is equivalent to \texttt{intros x y z} as the product on \texttt{z}
+  can be rewritten as a non-dependent product: %
+  \verb+forall x y:nat, nat -> x=y -> y=x+
+
 
   \ErrMsg \errindex{No such hypothesis in current goal}
 
-- 
cgit v1.2.3