X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_tactics.xml;h=0205ce8a896f286f0f75154f2eaa4764c9c85ebb;hb=275a432d33c455d75725d5991e82b62e7d01f68d;hp=468a27695c6e64495fd5450cc66b0eed395de912;hpb=ccd1ec9a248921b2c81817b1a7f6f0a2f27d5c32;p=helm.git diff --git a/helm/software/matita/help/C/sec_tactics.xml b/helm/software/matita/help/C/sec_tactics.xml index 468a27695..0205ce8a8 100644 --- a/helm/software/matita/help/C/sec_tactics.xml +++ b/helm/software/matita/help/C/sec_tactics.xml @@ -61,7 +61,7 @@ Pre-conditions: t must have type - T1 → ... → + T1 → … → Tn → G where G can be unified with the conclusion of the current sequent. @@ -89,13 +89,13 @@ applyS applyS - applyS t + applyS t auto_params Synopsis: - applyS &sterm; + applyS &sterm; &autoparams; @@ -123,6 +123,8 @@ Then it closes the current sequent by applying t to n implicit arguments (that become new sequents). + The auto_params parameters are passed + directly to auto paramodulation. @@ -176,13 +178,14 @@ auto auto - auto depth=d width=w paramodulation full + auto params Synopsis: - auto [depth=&nat;] [width=&nat;] [paramodulation] [full] + auto &autoparams;. + autobatch &autoparams; @@ -190,10 +193,11 @@ None, but the tactic may fail finding a proof if every proof is in the search space that is pruned away. Pruning is - controlled by d and w. + controlled by the optional params. Moreover, only lemmas whose type signature is a subset of the signature of the current sequent are considered. The signature of - a sequent is ...TODO + a sequent is essentially the set of constats appearing in it. + @@ -213,6 +217,52 @@ + + cases + cases + + cases t hyps + + + + + Synopsis: + + + cases + &term; [([&id;]…)] + + + + + Pre-conditions: + + + t must inhabit an inductive type + + + + + Action: + + + It proceed by cases on t. The new generated + hypothesis in each branch are named according to + hyps. + + + + + New sequents to prove: + + One new sequent for each constructor of the type of + t. Each sequent has a new hypothesis for + each argument of the constructor. + + + + + clear clear @@ -296,6 +346,58 @@ + + compose + compose + compose n t1 with t2 hyps + + + + Synopsis: + + compose [&nat;] &sterm; [with &sterm;] [&intros-spec;] + + + + Pre-conditions: + + + + + + Action: + + Composes t1 with t2 in every possible way + n times introducing generated terms + as if intros hyps was issued. + If t1:∀x:A.B[x] and + t2:∀x,y:A.B[x]→B[y]→C[x,y] it generates: + + + λx,y:A.t2 x y (t1 x) : ∀x,y:A.B[y]→C[x,y] + + + λx,y:A.λH:B[x].t2 x y H (t1 y) : ∀x,y:A.B[x]→C[x,y] + + + + + If t2 is omitted it composes + t1 + with every hypothesis that can be introduced. + n iterates the process. + + + + New sequents to prove: + + The same, but with more hypothesis eventually introduced + by the &intros-spec;. + + + + + change change @@ -448,8 +550,7 @@ decompose decompose - decompose (T1 ... Tn) - H as H1 ... Hm + decompose as H1 ... Hm @@ -458,10 +559,6 @@ decompose - [( - &id;… - )] - [&id;] [as &id;…] @@ -469,26 +566,22 @@ Pre-conditions: - - H must inhabit one inductive type among - - T1 ... Tn - - and the types of a predefined list. - + None. Action: - Runs - elim H H1 ... Hm - , clears H and tries to run itself - recursively on each new identifier introduced by + For each each premise H of type + T in the current context where + T is a non-recursive inductive type without + right parameters and of sort Prop or CProp, the tactic runs + + elim H as H1 ... Hm + , clears H and runs itself + recursively on each new premise introduced by elim in the opened sequents. - If H is not provided tries this operation on - each premise in the current context. @@ -506,13 +599,13 @@ demodulate demodulate - demodulate + demodulate auto_params Synopsis: - demodulate + demodulate &autoparams; @@ -579,13 +672,13 @@ elim elim - elim t using th hyps + elim t pattern using th hyps Synopsis: - elim &sterm; [using &sterm;] &intros-spec; + elim &sterm; &pattern; [using &sterm;] &intros-spec; @@ -602,6 +695,10 @@ It proceeds by cases on the values of t, according to the elimination principle th. + The induction predicate is restricted by + pattern. In particular, if some hypothesis + is listed in pattern, the hypothesis is + generalized and cleared before eliminating t @@ -1253,40 +1350,6 @@ - - reduce - reduce - reduce patt - - - - Synopsis: - - reduce &pattern; - - - - Pre-conditions: - - None. - - - - Action: - - It replaces all the terms matched by patt - with their βδιζ-normal form. - - - - New sequents to prove: - - None. - - - - - reflexivity reflexivity