More commands documented.

diff --git a/matita/help/C/sec_commands.xml b/matita/help/C/sec_commands.xml
index 7141d0ddffd1ff22dab3ded1fa43c6521f564fcf..636eac8dc236a66cb744ca5fa8d59e2c5c86ed50 100644 (file)
--- a/matita/help/C/sec_commands.xml
+++ b/matita/help/C/sec_commands.xml
@@ -9,7 +9,7 @@
    <para><userinput>alias num (instance n) = &quot;def&quot;</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">alias</emphasis>
@@ -57,7 +57,7 @@
    <para><userinput>check t</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">check</emphasis> &term;</para>
@@ -79,7 +79,7 @@
    <para><userinput>coercion u</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">coercion</emphasis> &uri;</para>
@@ -110,20 +110,82 @@
  </sect1>
  <sect1 id="command_default">
    <title>default</title>
-   <para><userinput></userinput></para>
+   <para><userinput>default &quot;s&quot; u<subscript>1</subscript> … u<subscript>n</subscript></userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">default</emphasis>
+            &qstring; &uri; [&uri;]…
            </para>
          </listitem>
        </varlistentry>
        <varlistentry>
          <term>Action:</term>
          <listitem>
-           <para>&TODO;</para>
+           <para>It registers a cluster of related definitions and
+            theorems to be used by tactics and the rendering engine.
+            Some functionalities of Matita are not available when some
+            clusters have not been registered. Overloading a cluster
+            registration is possible: the last registration will be the
+            default one, but the previous ones are still in effect.</para>
+           <para>
+            <command>s</command> is an identifier of the cluster and
+            <command>u<subscript>1</subscript> … u<subscript>n</subscript></command>
+            are the URIs of the definitions and theorems of the cluster.
+            The number <command>n</command> of required URIs depends on the
+            cluster. The following clusters are supported.
+           </para>
+           <table>
+            <title>clusters</title>
+            <tgroup cols="5">
+            <thead>
+             <row>
+              <entry>name</entry>
+              <entry>expected object for 1st URI</entry>
+              <entry>expected object for 2nd URI</entry>
+              <entry>expected object for 3rd URI</entry>
+              <entry>expected object for 4th URI</entry>
+              <entry>expected object for 5th URI</entry>
+             </row>
+            </thead>
+            <tbody>
+             <row>
+              <entry>equality</entry>
+              <entry>an inductive type (say, of type <command>eq</command>) of type ∀A:Type.A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis> with one family parameter and one constructor of type ∀x:A.eq A x</entry>
+              <entry>a theorem of type <emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>x,y:A.eq A x y <emphasis role="bold">→</emphasis> eq A y x</entry>
+              <entry>a theorem of type <emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>x,y,z:A.eq A x y <emphasis role="bold">→</emphasis> eq A y z <emphasis role="bold">→</emphasis> eq A x z</entry>
+              <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A x y <emphasis role="bold">→</emphasis> P y</entry>
+              <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A y x <emphasis role="bold">→</emphasis> P y</entry>
+             </row>
+             <row>
+              <entry>true</entry>
+              <entry>an inductive type of type <emphasis role="bold">Prop</emphasis> with only one constructor that has no arguments</entry>
+              <entry/>
+              <entry/>
+              <entry/>
+              <entry/>
+             </row>
+             <row>
+              <entry>false</entry>
+              <entry>an inductive type of type <emphasis role="bold">Prop</emphasis> without constructors</entry>
+              <entry/>
+              <entry/>
+              <entry/>
+              <entry/>
+             </row>
+             <row>
+              <entry>absurd</entry>
+              <entry>a theorem of type <emphasis role="bold">∀</emphasis>A:Prop.<emphasis role="bold">∀</emphasis>B:Prop.A <emphasis role="bold">→</emphasis> Not A <emphasis role="bold">→</emphasis> B</entry>
+              <entry/>
+              <entry/>
+              <entry/>
+              <entry/>
+             </row>
+            </tbody>
+            </tgroup>
+           </table>
          </listitem>
        </varlistentry>
      </variablelist>
@@ -134,7 +196,7 @@
    <para><userinput>hint</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">hint</emphasis>
@@ -160,7 +222,7 @@
    <para><userinput>include &quot;s&quot;</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">include</emphasis> &qstring;</para>
@@ -193,7 +255,7 @@
    <para><userinput></userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">include'</emphasis> &qstring;</para>
@@ -213,7 +275,7 @@
    <para><userinput>set &quot;baseuri&quot; &quot;s&quot;</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">set</emphasis> &qstring; &qstring;</para>
@@ -240,20 +302,33 @@
  </sect1>
  <sect1 id="command_whelp">
    <title>whelp</title>
-   <para><userinput></userinput></para>
+   <para><userinput>whelp locate &quot;s&quot;</userinput></para>
+   <para><userinput>whelp hint t</userinput></para>
+   <para><userinput>whelp elim t</userinput></para>
+   <para><userinput>whelp match t</userinput></para>
+   <para><userinput>whelp instance t</userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">whelp</emphasis>
+            [<emphasis role="bold">locate</emphasis> &qstring;
+            | <emphasis role="bold">hint</emphasis> &term;
+            | <emphasis role="bold">elim</emphasis> &term;
+            | <emphasis role="bold">match</emphasis> &term;
+            | <emphasis role="bold">instance</emphasis> &term;
+            ]
            </para>
          </listitem>
        </varlistentry>
        <varlistentry>
          <term>Action:</term>
          <listitem>
-           <para>&TODO;</para>
+           <para>Performs the corresponding <link linkend="whelp">query</link>,
+            showing the result in the CIC browser. The command is removed
+            from the script.
+           </para>
          </listitem>
        </varlistentry>
      </variablelist>
@@ -264,7 +339,7 @@
    <para><userinput></userinput></para>
    <para>
      <variablelist>
-       <varlistentry role="tactic.synopsis">
+       <varlistentry>
          <term>Synopsis:</term>
          <listitem>
            <para><emphasis role="bold">qed</emphasis>

diff --git a/matita/help/C/sec_tactics.xml b/matita/help/C/sec_tactics.xml
index e9f1567239ef53add4626f8705f6f3d37391d415..53a20ac6a78e3c07404d442cb8b7a0de17c7b661 100644 (file)
--- a/matita/help/C/sec_tactics.xml
+++ b/matita/help/C/sec_tactics.xml
@@ -86,6 +86,59 @@
       </variablelist>
     </para>
   </sect1>
+  <sect1 id="tac_applyS">
+    <title>applyS</title>
+    <titleabbrev>applyS</titleabbrev>
+    <para><userinput>applyS t</userinput></para>
+    <para>
+      <variablelist>
+        <varlistentry role="tactic.synopsis">
+          <term>Synopsis:</term>
+          <listitem>
+            <para><emphasis role="bold">applyS</emphasis> &sterm;</para>
+          </listitem>
+        </varlistentry>
+        <varlistentry>
+          <term>Pre-conditions:</term>
+          <listitem>
+            <para><command>t</command> must have type
+             <command>T<subscript>1</subscript> → ... →
+              T<subscript>n</subscript> → G</command>.</para>
+          </listitem>
+        </varlistentry>
+        <varlistentry>
+          <term>Action:</term>
+          <listitem>
+            <para><command>applyS</command> is useful when
+             <command>apply</command> fails because the current goal
+             and the conclusion of the applied theorems are extensionally
+             equivalent up to instantiation of metavariables, but cannot
+             be unified. E.g. the goal is <command>P(n*O+m)</command> and
+             the theorem to be applied proves <command>∀m.P(m+O)</command>.
+            </para>
+            <para>
+             It tries to automatically rewrite the current goal using
+             <link linkend="tac_auto">auto paramodulation</link>
+             to make it unifiable with <command>G</command>.
+             Then it closes the current sequent by applying
+             <command>t</command> to <command>n</command>
+             implicit arguments (that become new sequents).
+            </para>
+          </listitem>
+        </varlistentry>
+        <varlistentry>
+          <term>New sequents to prove:</term>
+          <listitem>
+            <para>It opens a new sequent for each premise 
+             <command>T<subscript>i</subscript></command> that is not
+             instantiated by unification. <command>T<subscript>i</subscript></command> is
+             the conclusion of the <command>i</command>-th new sequent to
+             prove.</para>
+          </listitem>
+        </varlistentry>
+      </variablelist>
+    </para>
+  </sect1>
   <sect1 id="tac_assumption">
     <title>assumption</title>
     <titleabbrev>assumption</titleabbrev>

diff --git a/matita/help/C/tactic_quickref.xml b/matita/help/C/tactic_quickref.xml
index 17a0313082f2153e76ea9a918fe78a0ff59ec71d..e44a53068e7bd6a17bcde0c95b23dca929c30e63 100644 (file)
--- a/matita/help/C/tactic_quickref.xml
+++ b/matita/help/C/tactic_quickref.xml
@@ -12,6 +12,11 @@
         <entry>|</entry>
         <entry><link linkend="tac_apply"><emphasis role="bold">apply</emphasis></link> <emphasis><link linkend="grammar.sterm">sterm</link></emphasis></entry>
       </row>
+      <row>
+        <entry/>
+        <entry>|</entry>
+        <entry><link linkend="tac_applyS"><emphasis role="bold">applyS</emphasis></link> <emphasis><link linkend="grammar.sterm">sterm</link></emphasis></entry>
+      </row>
       <row>
         <entry/>
         <entry>|</entry>