X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=inline;f=matita%2Fhelp%2FC%2Fsec_tactics.xml;h=53a20ac6a78e3c07404d442cb8b7a0de17c7b661;hb=f27b26f3f3d2300b11aa4d68dbe823e15ffbdf1c;hp=56c2a66167b4e47c17f14cecb6ec5a7cde65a809;hpb=1beb5e1624ac1db045e36dff93d0cfafa6a70995;p=helm.git
diff --git a/matita/help/C/sec_tactics.xml b/matita/help/C/sec_tactics.xml
index 56c2a6616..53a20ac6a 100644
--- a/matita/help/C/sec_tactics.xml
+++ b/matita/help/C/sec_tactics.xml
@@ -86,6 +86,59 @@
+
+ applyS
+ applyS
+ applyS t
+
+
+
+ Synopsis:
+
+ applyS &sterm;
+
+
+
+ Pre-conditions:
+
+ t must have type
+ T1 â ... â
+ Tn â G.
+
+
+
+ Action:
+
+ applyS is useful when
+ apply 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 P(n*O+m) and
+ the theorem to be applied proves âm.P(m+O).
+
+
+ It tries to automatically rewrite the current goal using
+ auto paramodulation
+ to make it unifiable with G.
+ Then it closes the current sequent by applying
+ t to n
+ implicit arguments (that become new sequents).
+
+
+
+
+ New sequents to prove:
+
+ It opens a new sequent for each premise
+ Ti that is not
+ instantiated by unification. Ti is
+ the conclusion of the i-th new sequent to
+ prove.
+
+
+
+
+ assumptionassumption
@@ -450,16 +503,16 @@
-
- demodulation
- demodulation
- demodulation patt
+
+ demodulate
+ demodulate
+ demodulateSynopsis:
- demodulation &pattern;
+ demodulate
@@ -1061,7 +1114,7 @@ its constructor takes no arguments.lapplylapply
- lapply depth=d t
+ lapply linear depth=d t
to t1, ..., tn as H
@@ -1071,6 +1124,7 @@ its constructor takes no arguments.lapply
+ [linear]
[depth=&nat;]
&sterm;
[to
@@ -1108,6 +1162,10 @@ its constructor takes no arguments.
Usually the other ?'s preceding the
n-th independent premise of
t are istantiated as a consequence.
+ If the linear flag is specified and if
+ t, t1, ..., tn
+ are (applications of) premises in the current context, they are
+ cleared.
@@ -1227,39 +1285,6 @@ its constructor takes no arguments.
-
- paramodulation
- paramodulation
- paramodulation patt
-
-
-
- Synopsis:
-
- paramodulation &pattern;
-
-
-
- Pre-conditions:
-
- TODO.
-
-
-
- Action:
-
- TODO.
-
-
-
- New sequents to prove:
-
- TODO.
-
-
-
-
- reducereduce