X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_commands.xml;h=4fe77d7b78a8dc3e4871322b5d6a5c736ce11ccb;hb=d2a898e8636c360713d8c9967f1de74e3e077c3f;hp=0ea8c06f970ee618dd6e76510a39b81f1a6efd5c;hpb=ade543268430b595a7aef9fd14c19e2b1d22770d;p=helm.git
diff --git a/helm/software/matita/help/C/sec_commands.xml b/helm/software/matita/help/C/sec_commands.xml
index 0ea8c06f9..4fe77d7b7 100644
--- a/helm/software/matita/help/C/sec_commands.xml
+++ b/helm/software/matita/help/C/sec_commands.xml
@@ -9,13 +9,13 @@
alias num (instance n) = "def"
-
+ Synopsis:alias
- [id"&string;"="&string;"
- | symbol"&string;" [(instance &nat;)] ="&string;"
- | num [(instance &nat;)] ="&string;"
+ [id &qstring; = &qstring;
+ | symbol &qstring; [(instance &nat;)] = &qstring;
+ | num [(instance &nat;)] = &qstring;
]
@@ -54,20 +54,21 @@
check
-
+ check t
-
+ Synopsis:
- check
-
+ check &term;Action:
- &TODO;
+ Opens a CIC browser window that shows t
+ together with its type. The command is immediately removed from
+ the script.
@@ -75,20 +76,33 @@
coercion
-
+ coercion u
-
+ Synopsis:
- coercion
-
+ coercion &uri;Action:
- &TODO;
+ Declares u as an implicit coercion
+ from the type of its last argument (source)
+ to its codomain (target). Every time a term x
+ of type source is used with expected type target, Matita
+ automatically replaces x with
+ (u ? ⦠? x) to avoid a typing error.
+ Implicit coercions are not displayed to the user:
+ (u ? ⦠? x) is rendered simply
+ as x.
+ When a coercion u is declared
+ from source s to target t
+ and there is already a coercion u' of
+ target s or source t,
+ a composite implicit coercion is automatically computed
+ by Matita.
@@ -96,20 +110,94 @@
default
-
+ default "s" u1 ⦠un
-
+ Synopsis:default
+ &qstring; &uri; [&uri;]â¦
Action:
- &TODO;
+ It registers a cluster of related definitions and
+ theorems to be used by tactics and the rendering engine.
+ Some functionalities of Matita are not available when some
+ clusters have not been registered. Overloading a cluster
+ registration is possible: the last registration will be the
+ default one, but the previous ones are still in effect.
+
+ s is an identifier of the cluster and
+ u1 ⦠un
+ are the URIs of the definitions and theorems of the cluster.
+ The number n of required URIs depends on the
+ cluster. The following clusters are supported.
+
+
+ clusters
+
+
+
+ name
+ expected object for 1st URI
+ expected object for 2nd URI
+ expected object for 3rd URI
+ expected object for 4th URI
+ expected object for 5th URI
+ expected object for 6th URI
+ expected object for 7th URI
+ expected object for 8th URI
+ expected object for 9th URI
+ expected object for 10th URI
+ expected object for 11th URI
+
+
+
+
+ equality
+ an inductive type (say, of type eq) of type âA:Type.A âProp with one family parameter and one constructor of type âx:A.eq A x
+ a theorem of type âA.âx,y:A.eq A x y â eq A y x
+ a theorem of type âA.âx,y,z:A.eq A x y â eq A y z â eq A x z
+ âA.âa.â P:A âProp.P x âây.eq A x y â P y
+ âA.âa.â P:A âProp.P x âây.eq A y x â P y
+ âA.âa.â P:A âSet.P x âây.eq A x y â P y
+ âA.âa.â P:A âSet.P x âây.eq A y x â P y
+ âA.âa.â P:A âType.P x âây.eq A x y â P y
+ âA.âa.â P:A âType.P x âây.eq A y x â P y
+ âA.âB.â f:A â B.âx,y:A.eq A x y â eq B (f x) (f y)
+ âA.âB.â f:A â B.âx,y:A.eq A x y â eq B (f y) (f x)
+
+
+ true
+ an inductive type of type Prop with only one constructor that has no arguments
+
+
+
+
+
+
+ false
+ an inductive type of type Prop without constructors
+
+
+
+
+
+
+ absurd
+ a theorem of type âA:Prop.âB:Prop.A â Not A â B
+
+
+
+
+
+
+
+
@@ -117,10 +205,10 @@
hint
-
+ hint
-
+ Synopsis:hint
@@ -130,7 +218,12 @@
Action:
- &TODO;
+ Displays a list of theorems that can be successfully
+ applied to the current selected sequent. The command is
+ removed from the script, but the window that displays the
+ theorems allow to add to the script the application of the
+ selected theorem.
+
@@ -138,62 +231,51 @@
include
-
+ include "s"
-
+ Synopsis:
- include
-
+ include &qstring;Action:
- &TODO;
+ Every coercion,
+ notation and
+ interpretation that was active
+ when the file s was compiled last time
+ is made active. The same happens for declarations of
+ default definitions and
+ theorems and disambiguation
+ hints (aliases).
+ On the contrary, theorem and definitions declared in a file can be
+ immediately used without including it.
+ The file s is automatically compiled
+ if it is not compiled yet.
+
- include'
+ include' "s"
-
- Synopsis:
-
- include'
-
-
-
- Action:
-
- &TODO;
-
-
-
-
-
-
- set
-
-
-
- Synopsis:
- set
-
+ include' &qstring;Action:
- &TODO;
+ Not documented (&TODO;), do not use it.
@@ -201,20 +283,33 @@
whelp
-
+ whelp locate "s"
+ whelp hint t
+ whelp elim t
+ whelp match t
+ whelp instance t
-
+ Synopsis:whelp
+ [locate &qstring;
+ | hint &term;
+ | elim &term;
+ | match &term;
+ | instance &term;
+ ]
Action:
- &TODO;
+ Performs the corresponding query,
+ showing the result in the CIC browser. The command is removed
+ from the script.
+
@@ -225,7 +320,7 @@
-
+ Synopsis:qed
@@ -235,7 +330,10 @@
Action:
- &TODO;
+ Saves and indexes the current interactive theorem or
+ definition.
+ In order to do this, the set of sequents still to be proved
+ must be empty.