X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_tactics.xml;h=ebd100a26c408c5a242e0b87d221d43838e78692;hb=refs%2Fheads%2Fmatita-lablgtk3;hp=e03dece5bc1bd8ea612d0b4fdfe4153b66d9d899;hpb=1f974ca07c502d85c9a3760aaaf633bae3c84fb6;p=helm.git diff --git a/helm/software/matita/help/C/sec_tactics.xml b/helm/software/matita/help/C/sec_tactics.xml index e03dece5b..ebd100a26 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. @@ -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. + @@ -219,7 +221,7 @@ cases cases - cases t hyps + cases t pattern hyps @@ -228,7 +230,7 @@ cases - &term; [([&id;]…)] + &term; &pattern; [([&id;]…)] @@ -247,6 +249,12 @@ It proceed by cases on t. The new generated hypothesis in each branch are named according to hyps. + The elimintation predicate is restricted by + pattern. In particular, if some hypothesis + is listed in pattern, the hypothesis is + generalized and cleared before proceeding by cases on + t. Currently, we only support patterns of the + form H1 … Hn ⊢ %. This limitation will be lifted in the future. @@ -344,6 +352,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 @@ -545,13 +605,13 @@ demodulate demodulate - demodulate + demodulate auto_params Synopsis: - demodulate + demodulate &autoparams; @@ -618,13 +678,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; @@ -641,6 +701,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 @@ -1292,40 +1356,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