X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_tactics.xml;h=812c8ed970a2044472bcfd78653955ce29654fb0;hb=f569c2d610c176b1d85de41968c2f3fbe2aef4e2;hp=aa9610df0aa83e22c517da9782111274710a0d56;hpb=acbf7b2ffb8646634928895024cd9020e1f265ab;p=helm.git diff --git a/helm/software/matita/help/C/sec_tactics.xml b/helm/software/matita/help/C/sec_tactics.xml index aa9610df0..812c8ed97 100644 --- a/helm/software/matita/help/C/sec_tactics.xml +++ b/helm/software/matita/help/C/sec_tactics.xml @@ -184,7 +184,8 @@ Synopsis: - auto &autoparams; + auto &autoparams;. + autobatch &autoparams; @@ -195,7 +196,8 @@ 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. + @@ -344,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 @@ -496,8 +550,7 @@ decompose decompose - decompose (T1 ... Tn) - H as H1 ... Hm + decompose as H1 ... Hm @@ -506,10 +559,6 @@ decompose - [( - &id;… - )] - [&id;] [as &id;…] @@ -517,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. @@ -554,13 +599,13 @@ demodulate demodulate - demodulate + demodulate auto_params Synopsis: - demodulate + demodulate &autoparams; @@ -1301,40 +1346,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