X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=matita%2Fhelp%2FC%2Fsec_tactics.xml;h=e03dece5bc1bd8ea612d0b4fdfe4153b66d9d899;hb=ccf5bef29f42897a28ee7cc797c3d5698adfcb1d;hp=aa9610df0aa83e22c517da9782111274710a0d56;hpb=d781bb8353822c2a72a541de56b88fe48a23c48b;p=helm.git

diff --git a/matita/help/C/sec_tactics.xml b/matita/help/C/sec_tactics.xml
index aa9610df0..e03dece5b 100644
--- a/matita/help/C/sec_tactics.xml
+++ b/matita/help/C/sec_tactics.xml
@@ -496,8 +496,7 @@
     <title>decompose</title>
     <titleabbrev>decompose</titleabbrev>
     <para><userinput>
-     decompose (T<subscript>1</subscript> ... T<subscript>n</subscript>) 
-     H as H<subscript>1</subscript> ... H<subscript>m</subscript>
+     decompose as H<subscript>1</subscript> ... H<subscript>m</subscript>
     </userinput></para>
     <para>
       <variablelist>
@@ -506,10 +505,6 @@
           <listitem>
             <para>
 	     <emphasis role="bold">decompose</emphasis>
-	     [<emphasis role="bold">(</emphasis>
-	     &id;…
-	     <emphasis role="bold">)</emphasis>]
-	     [&id;] 
 	     [<emphasis role="bold">as</emphasis> &id;…]
 	    </para>
           </listitem>
@@ -517,26 +512,22 @@
         <varlistentry>
           <term>Pre-conditions:</term>
           <listitem>
-            <para> 
-	     <command>H</command> must inhabit one inductive type among  
-	     <command>
-	      T<subscript>1</subscript> ... T<subscript>n</subscript>
-	     </command>
-	     and the types of a predefined list.
-	    </para>
+            <para>None.</para>
           </listitem>
         </varlistentry>
         <varlistentry>
           <term>Action:</term>
           <listitem>
             <para>
-	     Runs <command>
-	      elim H H<subscript>1</subscript> ... H<subscript>m</subscript>
-	     </command>, clears <command>H</command> and tries to run itself
-	     recursively on each new identifier introduced by 
+	     For each each premise <command>H</command> of type 
+	     <command>T</command> in the current context where
+	     <command>T</command> is a non-recursive inductive type without
+	     right parameters and of sort Prop or CProp, the tactic runs
+	     <command> 
+	      elim H as H<subscript>1</subscript> ... H<subscript>m</subscript>
+	     </command>, clears <command>H</command>  and runs itself
+	     recursively on each new premise introduced by 
 	     <command>elim</command> in the opened sequents. 
-	     If <command>H</command> is not provided tries this operation on
-	     each premise in the current context.
 	    </para>
           </listitem>
         </varlistentry>