X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_tactics.xml;h=56037dde56bf7d59f20b4efc6d6b1f848a2b643a;hb=8752fac73a864c821b6954f0572bce2052924183;hp=fb695879f35cb92c8748f9b937647b8ce0b5fbd6;hpb=ebd137ecfde1fe0b10e32a939d2abd65d482a4c1;p=helm.git diff --git a/helm/software/matita/help/C/sec_tactics.xml b/helm/software/matita/help/C/sec_tactics.xml index fb695879f..56037dde5 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; + + - absurd &term; + absurd absurd absurd P + + Synopsis: + + absurd &sterm; + + Pre-conditions: @@ -33,11 +46,17 @@ - apply &term; + apply apply apply t + + Synopsis: + + apply &sterm; + + Pre-conditions: @@ -73,6 +92,12 @@ assumption + + Synopsis: + + assumption + + Pre-conditions: @@ -96,11 +121,17 @@ - auto [depth=&nat;] [width=&nat;] [paramodulation] [full] + auto auto auto depth=d width=w paramodulation full + + Synopsis: + + auto [depth=&nat;] [width=&nat;] [paramodulation] [full] + + Pre-conditions: @@ -130,23 +161,42 @@ - clear &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 +209,17 @@ - clearbody &id; + clearbody clearbody clearbody H + + Synopsis: + + clearbody &id; + + Pre-conditions: @@ -188,11 +244,17 @@ - change <pattern> with &term; + change change change patt with t + + Synopsis: + + change &pattern; with &sterm; + + Pre-conditions: @@ -220,11 +282,17 @@ - constructor &nat; + constructor constructor constructor n + + Synopsis: + + constructor &nat; + + Pre-conditions: @@ -257,6 +325,12 @@ contradiction + + Synopsis: + + contradiction + + Pre-conditions: @@ -281,11 +355,17 @@ - cut &term; [as &id;] + cut cut cut P as H + + Synopsis: + + cut &sterm; [as &id;] + + Pre-conditions: @@ -312,38 +392,109 @@ - decompose &id; [&id;]… [<intros_spec>] + decompose decompose - decompose ??? + + decompose (T1 ... Tn) + H as H1 ... Hm + + + Synopsis: + + + decompose + [( + &id;… + )] + [&id;] + [as &id;…] + + + Pre-conditions: - TODO. + + H must inhabit one inductive type among + + T1 ... Tn + + and the types of a predefined list. + Action: - TODO. + + 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. + New sequents to prove: - TODO. + + The ones generated by all the elim tactics run. + + + + + + + + demodulate + demodulate + demodulate + + + + Synopsis: + + demodulate + + + + Pre-conditions: + + None. + + + + Action: + + &TODO; + + + + New sequents to prove: + + None. - discriminate &term; + discriminate discriminate discriminate p + + Synopsis: + + discriminate &sterm; + + Pre-conditions: @@ -368,11 +519,17 @@ its constructor takes no arguments. - elim &term; [using &term;] [<intros_spec>] + elim elim elim t using th hyps + + Synopsis: + + elim &sterm; [using &sterm;] &intros-spec; + + Pre-conditions: @@ -405,11 +562,17 @@ its constructor takes no arguments. - elimType &term; [using &term;] [<intros_spec>] + elimType elimType elimType T using th hyps + + Synopsis: + + elimType &sterm; [using &sterm;] &intros-spec; + + Pre-conditions: @@ -432,11 +595,17 @@ its constructor takes no arguments. - exact &term; + exact exact exact p + + Synopsis: + + exact &sterm; + + Pre-conditions: @@ -465,6 +634,12 @@ its constructor takes no arguments. exists + + Synopsis: + + exists + + Pre-conditions: @@ -491,11 +666,17 @@ its constructor takes no arguments. - fail - failt + fail + fail fail + + Synopsis: + + fail + + Pre-conditions: @@ -518,11 +699,17 @@ its constructor takes no arguments. - fold <reduction_kind> &term; <pattern> + fold fold fold red t patt + + Synopsis: + + fold &reduction-kind; &sterm; &pattern; + + Pre-conditions: @@ -555,6 +742,12 @@ its constructor takes no arguments. fourier + + Synopsis: + + fourier + + Pre-conditions: @@ -580,38 +773,67 @@ its constructor takes no arguments. - fwd &id; [<ident list>] + 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. + - generalize <pattern> [as &id;] + generalize generalize generalize patt as H + + Synopsis: + + generalize &pattern; [as &id;] + + Pre-conditions: @@ -648,6 +870,12 @@ its constructor takes no arguments. id + + Synopsis: + + id + + Pre-conditions: @@ -670,11 +898,17 @@ its constructor takes no arguments. - injection &term; + injection injection injection p + + Synopsis: + + injection &sterm; + + Pre-conditions: @@ -701,11 +935,17 @@ its constructor takes no arguments. - intro [&id;] + intro intro intro H + + Synopsis: + + intro [&id;] + + Pre-conditions: @@ -734,11 +974,17 @@ its constructor takes no arguments. - intros <intros_spec> + intros intros intros hyps + + Synopsis: + + intros &intros-spec; + + Pre-conditions: @@ -771,11 +1017,17 @@ its constructor takes no arguments. - inversion &term; + inversion inversion inversion t + + Synopsis: + + inversion &sterm; + + Pre-conditions: @@ -806,27 +1058,70 @@ its constructor takes no arguments. - lapply [depth=&nat;] &term; [to <term list>] [using &id;] + lapply lapply - lapply ??? + + 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. + @@ -838,6 +1133,12 @@ its constructor takes no arguments. left + + Synopsis: + + left + + Pre-conditions: @@ -864,11 +1165,17 @@ its constructor takes no arguments. - letin &id; ≝ &term; + letin letin letin x ≝ t + + Synopsis: + + letin &id; ≝ &sterm; + + Pre-conditions: @@ -892,11 +1199,17 @@ its constructor takes no arguments. - normalize <pattern> + normalize normalize normalize patt + + Synopsis: + + normalize &pattern; + + Pre-conditions: @@ -920,11 +1233,17 @@ its constructor takes no arguments. - paramodulation <pattern> + paramodulation paramodulation paramodulation patt + + Synopsis: + + paramodulation &pattern; + + Pre-conditions: @@ -947,11 +1266,17 @@ its constructor takes no arguments. - reduce <pattern> + reduce reduce reduce patt + + Synopsis: + + reduce &pattern; + + Pre-conditions: @@ -980,6 +1305,12 @@ its constructor takes no arguments. reflexivity + + Synopsis: + + reflexivity + + Pre-conditions: @@ -1004,11 +1335,17 @@ its constructor takes no arguments. - replace <pattern> with &term; + replace change change patt with t + + Synopsis: + + replace &pattern; with &sterm; + + Pre-conditions: @@ -1036,11 +1373,17 @@ its constructor takes no arguments. - rewrite [<|>] &term; <pattern> + rewrite rewrite rewrite dir p patt + + Synopsis: + + rewrite [<|>] &sterm; &pattern; + + Pre-conditions: @@ -1076,6 +1419,12 @@ its constructor takes no arguments. right + + Synopsis: + + right + + Pre-conditions: @@ -1107,6 +1456,12 @@ its constructor takes no arguments. ring + + Synopsis: + + ring + + Pre-conditions: @@ -1133,11 +1488,17 @@ its constructor takes no arguments. - simplify <pattern> + simplify simplify simplify patt + + Synopsis: + + simplify &pattern; + + Pre-conditions: @@ -1166,6 +1527,12 @@ its constructor takes no arguments. split + + Synopsis: + + split + + Pre-conditions: @@ -1198,6 +1565,12 @@ its constructor takes no arguments. symmetry + + Synopsis: + + symmetry + + Pre-conditions: @@ -1221,11 +1594,17 @@ its constructor takes no arguments. - transitivity &term; + transitivity transitivity transitivity t + + Synopsis: + + transitivity &sterm; + + Pre-conditions: @@ -1250,11 +1629,17 @@ the current sequent to prove. - unfold [&term;] <pattern> + unfold unfold unfold t patt + + Synopsis: + + unfold [&sterm;] &pattern; + + Pre-conditions: @@ -1282,11 +1667,17 @@ the current sequent to prove. - whd <pattern> + whd whd whd patt + + Synopsis: + + whd &pattern; + + Pre-conditions: