X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_commands.xml;h=4d788f39aa3feb8ed01961dd48a782b9ec2a6436;hb=f8f3f0bf31de02f543b9bb5e944ea01fd706d3a0;hp=636eac8dc236a66cb744ca5fa8d59e2c5c86ed50;hpb=65317d14f32bc24b3e9ed4ea144833dd8517773a;p=helm.git diff --git a/helm/software/matita/help/C/sec_commands.xml b/helm/software/matita/help/C/sec_commands.xml index 636eac8dc..4d788f39a 100644 --- a/helm/software/matita/help/C/sec_commands.xml +++ b/helm/software/matita/help/C/sec_commands.xml @@ -76,24 +76,34 @@ coercion - coercion u + coercion u with ariety saturation nocomposites Synopsis: - coercion &uri; + + coercion + (&uri; | &term; with) + [ &nat; [&nat;]] + [ nocomposites ] + Action: - Declares u as an implicit coercion - from the type of its last argument (source) - to its codomain (target). Every time a term x + Declares u as an implicit coercion. + If the type of u is + ∀x1:T1. … ∀x(n-1):T(n-1).Tn the coercion target is + T(n - ariety) while its source is + T(n - ariety - saturation - 1). + 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. + (u ? … ? x ? … ?) to avoid a typing error. + Note that the number of ? added after + x is saturation. Implicit coercions are not displayed to the user: (u ? … ? x) is rendered simply as x. @@ -102,7 +112,8 @@ and there is already a coercion u' of target s or source t, a composite implicit coercion is automatically computed - by Matita. + by Matita unless nocomposites + is specified. @@ -139,7 +150,7 @@ clusters - + name @@ -148,6 +159,12 @@ 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 @@ -158,6 +175,12 @@ 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 @@ -242,8 +265,7 @@ 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 and if it is handled by a - development. + if it is not compiled yet. @@ -270,36 +292,6 @@ - - set - set "baseuri" "s" - - - - Synopsis: - - set &qstring; &qstring; - - - - Action: - - Sets to s the baseuri of all the - theorems and definitions stated in the current file. - The baseuri should be a/b/c/foo - if the file is named foo and it is in - the subtree a/b/c of the current - development. - This requirement is not enforced, but it could be in the future. - - Currently, baseuri is the only - property that can be set even if the parser accepts - arbitrary property names. - - - - - whelp whelp locate "s"