X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fhelp%2FC%2Fsec_tactics.xml;h=e03dece5bc1bd8ea612d0b4fdfe4153b66d9d899;hb=ccf5bef29f42897a28ee7cc797c3d5698adfcb1d;hp=ff8d099c0180101efba481ec0f7cd16ed0308ace;hpb=76917216be769918258c90e486bb7c06d81b70b4;p=helm.git
diff --git a/matita/help/C/sec_tactics.xml b/matita/help/C/sec_tactics.xml
index ff8d099c0..e03dece5b 100644
--- a/matita/help/C/sec_tactics.xml
+++ b/matita/help/C/sec_tactics.xml
@@ -215,6 +215,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
@@ -450,8 +496,7 @@
decompose
decompose
- decompose (T1 ... Tn)
- H as H1 ... Hm
+ decompose as H1 ... Hm
@@ -460,10 +505,6 @@
decompose
- [(
- &id;â¦
- )]
- [&id;]
[as &id;â¦]
@@ -471,26 +512,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.