X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambda_delta%2FBasic_2%2Fgrammar%2Fitem.ma;h=89f1a94e4d2eef0997f041f93bf099c4539d6920;hb=48b202cd4ccd3ffc10f9a134314f747fdee30d36;hp=7b35d0ca5d3e4b875b888a66b8e88534822005ad;hpb=035e3f52f8da3cb3cdb493aa20568ad673cc2cf5;p=helm.git diff --git a/matita/matita/contribs/lambda_delta/Basic_2/grammar/item.ma b/matita/matita/contribs/lambda_delta/Basic_2/grammar/item.ma index 7b35d0ca5..89f1a94e4 100644 --- a/matita/matita/contribs/lambda_delta/Basic_2/grammar/item.ma +++ b/matita/matita/contribs/lambda_delta/Basic_2/grammar/item.ma @@ -12,16 +12,7 @@ (* *) (**************************************************************************) -(* THE FORMAL SYSTEM λδ - MATITA SOURCE FILES - * Specification started: 2011 April 17 - * Confluence of context-sensitive parallel reduction closed: 2011 September 21 - * Confluence of context-free parallel reduction closed: 2011 September 6 - * - Patience on me so that I gain peace and perfection! - - * [ suggested invocation to start formal specifications with ] - *) - -include "Ground_2/list.ma". -include "Ground_2/star.ma". +include "Ground_2/arith.ma". include "Basic_2/notation.ma". (* ITEMS ********************************************************************) @@ -47,16 +38,30 @@ inductive flat2: Type[0] ≝ (* binary items *) inductive item2: Type[0] ≝ - | Bind: bind2 → item2 (* binding item *) - | Flat: flat2 → item2 (* non-binding item *) + | Bind2: bind2 → item2 (* binding item *) + | Flat2: flat2 → item2 (* non-binding item *) . -coercion item2_of_bind2: ∀I:bind2.item2 ≝ Bind on _I:bind2 to item2. +coercion item2_of_bind2: ∀I:bind2.item2 ≝ Bind2 on _I:bind2 to item2. -coercion item2_of_flat2: ∀I:flat2.item2 ≝ Flat on _I:flat2 to item2. +coercion item2_of_flat2: ∀I:flat2.item2 ≝ Flat2 on _I:flat2 to item2. -(* Basic_1: removed theorems 19: +(* Basic properties *********************************************************) + +axiom item0_eq_dec: ∀I1,I2:item0. Decidable (I1 = I2). + +(* Basic_1: was: bind_dec *) +axiom bind2_eq_dec: ∀I1,I2:bind2. Decidable (I1 = I2). + +(* Basic_1: was: flat_dec *) +axiom flat2_eq_dec: ∀I1,I2:flat2. Decidable (I1 = I2). + +(* Basic_1: was: kind_dec *) +axiom item2_eq_dec: ∀I1,I2:item2. Decidable (I1 = I2). + +(* Basic_1: removed theorems 21: s_S s_plus s_plus_sym s_minus minus_s_s s_le s_lt s_inj s_inc s_arith0 s_arith1 r_S r_plus r_plus_sym r_minus r_dis s_r r_arith0 r_arith1 + not_abbr_abst bind_dec_not *)