X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_tactics.xml;h=aa9610df0aa83e22c517da9782111274710a0d56;hb=536be1abc85882d042c31e301299c90786c9a355;hp=cc0043724f57c33fa32f0e7bec60dfff326c8098;hpb=cc16727f34114cee287e6a81b80f68657c656725;p=helm.git diff --git a/helm/software/matita/help/C/sec_tactics.xml b/helm/software/matita/help/C/sec_tactics.xml index cc0043724..aa9610df0 100644 --- a/helm/software/matita/help/C/sec_tactics.xml +++ b/helm/software/matita/help/C/sec_tactics.xml @@ -1,14 +1,27 @@ - Tactics + Tactics + + + Quick reference card + + &tacticref; + + - <emphasis role="bold">absurd</emphasis> &sterm; + absurd absurd absurd P + + Synopsis: + + absurd &sterm; + + Pre-conditions: @@ -33,11 +46,17 @@ - <emphasis role="bold">apply</emphasis> &sterm; + apply apply apply t + + Synopsis: + + apply &sterm; + + Pre-conditions: @@ -67,12 +86,73 @@ + + applyS + applyS + applyS t auto_params + + + + Synopsis: + + applyS &sterm; &autoparams; + + + + 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). + The auto_params parameters are passed + directly to auto paramodulation. + + + + + 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. + + + + + - <emphasis role="bold">assumption</emphasis> + assumption assumption assumption + + Synopsis: + + assumption + + Pre-conditions: @@ -96,20 +176,26 @@ - <emphasis role="bold">auto</emphasis> [<emphasis role="bold">depth=</emphasis>&nat;] [<emphasis role="bold">width=</emphasis>&nat;] [<emphasis role="bold">paramodulation</emphasis>] [<emphasis role="bold">full</emphasis>] + auto auto - auto depth=d width=w paramodulation full + auto params + + Synopsis: + + auto &autoparams; + + Pre-conditions: 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 ...&TODO; @@ -129,24 +215,89 @@ + + 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. + + + + + - <emphasis role="bold">clear</emphasis> &id; + clear clear - clear H + + clear H1 ... Hm + + + Synopsis: + + + clear + &id; [&id;…] + + + Pre-conditions: - H must be an hypothesis of the - current sequent to prove. + + + H1 ... Hm + must be hypotheses of the + current sequent to prove. + Action: - It hides the hypothesis H from the - current sequent. + + It hides the hypotheses + + H1 ... Hm + from the current sequent. + @@ -159,11 +310,17 @@ - <emphasis role="bold">clearbody</emphasis> &id; + clearbody clearbody clearbody H + + Synopsis: + + clearbody &id; + + Pre-conditions: @@ -188,11 +345,17 @@ - <emphasis role="bold">change</emphasis> &pattern; <emphasis role="bold">with</emphasis> &sterm; + change change change patt with t + + Synopsis: + + change &pattern; with &sterm; + + Pre-conditions: @@ -220,11 +383,17 @@ - <emphasis role="bold">constructor</emphasis> &nat; + constructor constructor constructor n + + Synopsis: + + constructor &nat; + + Pre-conditions: @@ -252,11 +421,17 @@ - <emphasis role="bold">contradiction</emphasis> + contradiction contradiction contradiction + + Synopsis: + + contradiction + + Pre-conditions: @@ -281,11 +456,17 @@ - <emphasis role="bold">cut</emphasis> &sterm; [<emphasis role="bold">as</emphasis> &id;] + cut cut cut P as H + + Synopsis: + + cut &sterm; [as &id;] + + Pre-conditions: @@ -312,13 +493,27 @@ - <emphasis role="bold">decompose</emphasis> &id; [&id;]… &intros-spec; + decompose decompose - decompose (T1 ... Tn) H hips + decompose (T1 ... Tn) + H as H1 ... Hm + + Synopsis: + + + decompose + [( + &id;… + )] + [&id;] + [as &id;…] + + + Pre-conditions: @@ -335,9 +530,13 @@ Action: - Runs elim H hyps, clears H and tries to run - itself recursively on each new identifier introduced by - elim in the opened sequents. + Runs + elim H H1 ... Hm + , clears H and tries to run itself + recursively on each new identifier introduced by + elim in the opened sequents. + If H is not provided tries this operation on + each premise in the current context. @@ -352,12 +551,18 @@ - - <emphasis role="bold">demodulation</emphasis> &pattern; - demodulation - demodulation patt + + demodulate + demodulate + demodulate + + Synopsis: + + demodulate + + Pre-conditions: @@ -379,24 +584,35 @@ - - <emphasis role="bold">discriminate</emphasis> &sterm; - discriminate - discriminate p + + destruct + destruct + destruct p + + Synopsis: + + destruct &sterm; + + Pre-conditions: - p must have type K t1 ... tn = K' t'1 ... t'm where K and K' must be different constructors of the same inductive type and each argument list can be empty if -its constructor takes no arguments. + p must have type E1 = E2 where the two sides of the equality are possibly applied constructors of an inductive type. Action: - It closes the current sequent by proving the absurdity of - p. + The tactic recursively compare the two sides of the equality + looking for different constructors in corresponding position. + If two of them are found, the tactic closes the current sequent + by proving the absurdity of p. Otherwise + it adds a new hypothesis for each leaf of the formula that + states the equality of the subformulae in the corresponding + positions on the two sides of the equality. + @@ -409,11 +625,17 @@ its constructor takes no arguments. - <emphasis role="bold">elim</emphasis> &sterm; [<emphasis role="bold">using</emphasis> &sterm;] &intros-spec; + elim elim elim t using th hyps + + Synopsis: + + elim &sterm; [using &sterm;] &intros-spec; + + Pre-conditions: @@ -446,11 +668,17 @@ its constructor takes no arguments. - <emphasis role="bold">elimType</emphasis> &sterm; [<emphasis role="bold">using</emphasis> &sterm;] &intros-spec; + elimType elimType elimType T using th hyps + + Synopsis: + + elimType &sterm; [using &sterm;] &intros-spec; + + Pre-conditions: @@ -473,11 +701,17 @@ its constructor takes no arguments. - <emphasis role="bold">exact</emphasis> &sterm; + exact exact exact p + + Synopsis: + + exact &sterm; + + Pre-conditions: @@ -501,11 +735,17 @@ its constructor takes no arguments. - <emphasis role="bold">exists</emphasis> + exists exists exists + + Synopsis: + + exists + + Pre-conditions: @@ -532,11 +772,17 @@ its constructor takes no arguments. - <emphasis role="bold">fail</emphasis> + fail fail fail + + Synopsis: + + fail + + Pre-conditions: @@ -559,11 +805,17 @@ its constructor takes no arguments. - <emphasis role="bold">fold</emphasis> &reduction-kind; &sterm; &pattern; + fold fold fold red t patt + + Synopsis: + + fold &reduction-kind; &sterm; &pattern; + + Pre-conditions: @@ -591,11 +843,17 @@ its constructor takes no arguments. - <emphasis role="bold">fourier</emphasis> + fourier fourier fourier + + Synopsis: + + fourier + + Pre-conditions: @@ -621,38 +879,67 @@ its constructor takes no arguments. - <emphasis role="bold">fwd</emphasis> &id; [<emphasis role="bold">(</emphasis>[&id;]…<emphasis role="bold">)</emphasis>] + fwd fwd - fwd ...TODO + fwd H as H0 ... Hn + + Synopsis: + + fwd &id; [as &id; [&id;]…] + + Pre-conditions: - TODO. + + The type of H must be the premise of a + forward simplification theorem. + Action: - TODO. + + This tactic is under development. + It simplifies the current context by removing + H using the following methods: + forward application (by lapply) of a suitable + simplification theorem, chosen automatically, of which the type + of H is a premise, + decomposition (by decompose), + rewriting (by rewrite). + H0 ... Hn + are passed to the tactics fwd invokes, as + names for the premise they introduce. + New sequents to prove: - TODO. + + The ones opened by the tactics fwd invokes. + - <emphasis role="bold">generalize</emphasis> &pattern; [<emphasis role="bold">as</emphasis> &id;] + generalize generalize generalize patt as H + + Synopsis: + + generalize &pattern; [as &id;] + + Pre-conditions: @@ -684,69 +971,50 @@ its constructor takes no arguments. - <emphasis role="bold">id</emphasis> + id id id - - Pre-conditions: + + Synopsis: - None. + id - - Action: - - This identity tactic does nothing without failing. - - - - New sequents to prove: - - None. - - - - - - - <emphasis role="bold">injection</emphasis> &sterm; - injection - injection p - - Pre-conditions: - p must have type K t1 ... tn = K t'1 ... t'n where both argument lists are empty if -K takes no arguments. + None. Action: - It derives new hypotheses by injectivity of - K. + This identity tactic does nothing without failing. New sequents to prove: - The new sequent to prove is equal to the current sequent - with the additional hypotheses - t1=t'1 ... tn=t'n. + None. - <emphasis role="bold">intro</emphasis> [&id;] + intro intro intro H + + Synopsis: + + intro [&id;] + + Pre-conditions: @@ -775,11 +1043,17 @@ its constructor takes no arguments. - <emphasis role="bold">intros</emphasis> &intros-spec; + intros intros intros hyps + + Synopsis: + + intros &intros-spec; + + Pre-conditions: @@ -812,11 +1086,17 @@ its constructor takes no arguments. - <emphasis role="bold">inversion</emphasis> &sterm; + inversion inversion inversion t + + Synopsis: + + inversion &sterm; + + Pre-conditions: @@ -847,41 +1127,87 @@ its constructor takes no arguments. - <emphasis role="bold">lapply</emphasis> [<emphasis role="bold">depth=</emphasis>&nat;] &sterm; [<emphasis role="bold">to</emphasis> &sterm; [&sterm;]…] [<emphasis role="bold">as</emphasis> &id;] + lapply lapply - lapply depth=d t + lapply linear depth=d t to t1, ..., tn as H + + Synopsis: + + + lapply + [linear] + [depth=&nat;] + &sterm; + [to + &sterm; + [,&sterm;…] + ] + [as &id;] + + + Pre-conditions: - TODO. + + t must have at least d + independent premises and n must not be + greater than d. + Action: - TODO. + + Invokes letin H ≝ (t ? ... ?) + with enough ?'s to reach the + d-th independent premise of + t + (d is maximum if unspecified). + Then istantiates (by apply) with + t1, ..., tn + the ?'s corresponding to the first + n independent premises of + t. + 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. + New sequents to prove: - TODO. + + The ones opened by the tactics lapply invokes. + - <emphasis role="bold">left</emphasis> + left left left + + Synopsis: + + left + + Pre-conditions: @@ -908,11 +1234,17 @@ its constructor takes no arguments. - <emphasis role="bold">letin</emphasis> &id; <emphasis role="bold">≝</emphasis> &sterm; + letin letin letin x ≝ t + + Synopsis: + + letin &id; ≝ &sterm; + + Pre-conditions: @@ -936,11 +1268,17 @@ its constructor takes no arguments. - <emphasis role="bold">normalize</emphasis> &pattern; + normalize normalize normalize patt + + Synopsis: + + normalize &pattern; + + Pre-conditions: @@ -963,39 +1301,18 @@ its constructor takes no arguments. - - <emphasis role="bold">paramodulation</emphasis> &pattern; - paramodulation - paramodulation patt - - - - Pre-conditions: - - TODO. - - - - Action: - - TODO. - - - - New sequents to prove: - - TODO. - - - - - - <emphasis role="bold">reduce</emphasis> &pattern; + reduce reduce reduce patt + + Synopsis: + + reduce &pattern; + + Pre-conditions: @@ -1019,11 +1336,17 @@ its constructor takes no arguments. - <emphasis role="bold">reflexivity</emphasis> + reflexivity reflexivity reflexivity + + Synopsis: + + reflexivity + + Pre-conditions: @@ -1048,11 +1371,17 @@ its constructor takes no arguments. - <emphasis role="bold">replace</emphasis> &pattern; <emphasis role="bold">with</emphasis> &sterm; + replace change change patt with t + + Synopsis: + + replace &pattern; with &sterm; + + Pre-conditions: @@ -1080,11 +1409,17 @@ its constructor takes no arguments. - <emphasis role="bold">rewrite</emphasis> [<emphasis role="bold"><</emphasis>|<emphasis role="bold">></emphasis>] &sterm; &pattern; + rewrite rewrite rewrite dir p patt + + Synopsis: + + rewrite [<|>] &sterm; &pattern; + + Pre-conditions: @@ -1115,11 +1450,17 @@ its constructor takes no arguments. - <emphasis role="bold">right</emphasis> + right right right + + Synopsis: + + right + + Pre-conditions: @@ -1146,11 +1487,17 @@ its constructor takes no arguments. - <emphasis role="bold">ring</emphasis> + ring ring ring + + Synopsis: + + ring + + Pre-conditions: @@ -1177,11 +1524,17 @@ its constructor takes no arguments. - <emphasis role="bold">simplify</emphasis> &pattern; + simplify simplify simplify patt + + Synopsis: + + simplify &pattern; + + Pre-conditions: @@ -1205,11 +1558,17 @@ its constructor takes no arguments. - <emphasis role="bold">split</emphasis> + split split split + + Synopsis: + + split + + Pre-conditions: @@ -1235,13 +1594,59 @@ its constructor takes no arguments. + + + subst + subst + subst + + + + Synopsis: + + subst + + + + Pre-conditions: + + None. + + + + Action: + + For each premise of the form + H: x = t or H: t = x + where x is a local variable and + t does not depend on x, + the tactic rewrites H wherever + x appears clearing H and + x afterwards. + + + + New sequents to prove: + + The one opened by the applied tactics. + + + + + - <emphasis role="bold">symmetry</emphasis> + symmetry symmetry The tactic symmetry symmetry + + Synopsis: + + symmetry + + Pre-conditions: @@ -1265,11 +1670,17 @@ its constructor takes no arguments. - <emphasis role="bold">transitivity</emphasis> &sterm; + transitivity transitivity transitivity t + + Synopsis: + + transitivity &sterm; + + Pre-conditions: @@ -1294,11 +1705,17 @@ the current sequent to prove. - <emphasis role="bold">unfold</emphasis> [&sterm;] &pattern; + unfold unfold unfold t patt + + Synopsis: + + unfold [&sterm;] &pattern; + + Pre-conditions: @@ -1326,11 +1743,17 @@ the current sequent to prove. - <emphasis role="bold">whd</emphasis> &pattern; + whd whd whd patt + + Synopsis: + + whd &pattern; + + Pre-conditions: