X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fdama%2Fexcess.ma;h=9068d297b215aea05faa417f2f3e365146a994c8;hb=7abdf2f1764ba67a48f0829f7a9813ce7426b0c6;hp=c7d31c2295da159bbbb720713ce260dacbf27d65;hpb=46fb7c601185d7aada2489700e7d7817d50e1e57;p=helm.git

diff --git a/helm/software/matita/dama/excess.ma b/helm/software/matita/dama/excess.ma
index c7d31c229..9068d297b 100644
--- a/helm/software/matita/dama/excess.ma
+++ b/helm/software/matita/dama/excess.ma
@@ -19,29 +19,39 @@ include "nat/plus.ma".
 include "constructive_higher_order_relations.ma".
 include "constructive_connectives.ma".
 
-record excess : Type ≝ {
+record excess_base : Type ≝ {
   exc_carr:> Type;
-  exc_relation: exc_carr → exc_carr → Type;
-  exc_coreflexive: coreflexive ? exc_relation;
-  exc_cotransitive: cotransitive ? exc_relation 
+  exc_excess: exc_carr → exc_carr → Type;
+  exc_coreflexive: coreflexive ? exc_excess;
+  exc_cotransitive: cotransitive ? exc_excess 
 }.
 
-interpretation "excess" 'nleq a b =
- (cic:/matita/excess/exc_relation.con _ a b). 
+interpretation "Excess base excess" 'nleq a b = (cic:/matita/excess/exc_excess.con _ a b). 
 
-definition le ≝ λE:excess.λa,b:E. ¬ (a ≰ b).
+(* E(#,≰) → E(#,sym(≰)) *)
+lemma make_dual_exc: excess_base → excess_base.
+intro E;
+apply (mk_excess_base (exc_carr E));
+  [ apply (λx,y:E.y≰x);|apply exc_coreflexive;
+  | unfold cotransitive; simplify; intros (x y z H);
+    cases (exc_cotransitive E ??z H);[right|left]assumption]
+qed.
 
-interpretation "ordered sets less or equal than" 'leq a b = 
- (cic:/matita/excess/le.con _ a b).
+record excess_dual : Type ≝ {
+  exc_dual_base:> excess_base;
+  exc_dual_dual_ : excess_base;
+  exc_with: exc_dual_dual_ = make_dual_exc exc_dual_base
+}.
 
-lemma le_reflexive: ∀E.reflexive ? (le E).
-intros (E); unfold; cases E; simplify; intros (x); apply (H x);
+lemma mk_excess_dual_smart: excess_base → excess_dual.
+intro; apply mk_excess_dual; [apply e| apply (make_dual_exc e)|reflexivity]
 qed.
 
-lemma le_transitive: ∀E.transitive ? (le E).
-intros (E); unfold; cases E; simplify; unfold Not; intros (x y z Rxy Ryz H2); 
-cases (c x z y H2) (H4 H5); clear H2; [exact (Rxy H4)|exact (Ryz H5)] 
-qed.
+definition exc_dual_dual: excess_dual → excess_base.
+intro E; apply (make_dual_exc E);
+qed. 
+
+coercion cic:/matita/excess/exc_dual_dual.con.
 
 record apartness : Type ≝ {
   ap_carr:> Type;
@@ -51,16 +61,11 @@ record apartness : Type ≝ {
   ap_cotransitive: cotransitive ? ap_apart
 }.
 
-notation "a break # b" non associative with precedence 50 for @{ 'apart $a $b}.
-interpretation "apartness" 'apart x y = 
-  (cic:/matita/excess/ap_apart.con _ x y).
-
-definition strong_ext ≝ λA:apartness.λop:A→A.∀x,y. op x # op y → x # y.
-
-definition apart ≝ λE:excess.λa,b:E. a ≰ b ∨ b ≰ a.
+notation "hvbox(a break # b)" non associative with precedence 50 for @{ 'apart $a $b}.
+interpretation "apartness" 'apart x y = (cic:/matita/excess/ap_apart.con _ x y).
 
-definition apart_of_excess: excess → apartness.
-intros (E); apply (mk_apartness E (apart E));  
+definition apartness_of_excess_base: excess_base → apartness.
+intros (E); apply (mk_apartness E (λa,b:E. a ≰ b ∨ b ≰ a));  
 [1: unfold; cases E; simplify; clear E; intros (x); unfold;
     intros (H1); apply (H x); cases H1; assumption;
 |2: unfold; intros(x y H); cases H; clear H; [right|left] assumption;
@@ -69,28 +74,76 @@ intros (E); apply (mk_apartness E (apart E));
     [left; left|right; left|right; right|left; right] assumption]
 qed.
 
-coercion cic:/matita/excess/apart_of_excess.con.
+record excess_ : Type ≝ {
+  exc_exc:> excess_dual;
+  exc_ap_: apartness;
+  exc_with1: ap_carr exc_ap_ = exc_carr exc_exc
+}.
+
+definition exc_ap: excess_ → apartness.
+intro E; apply (mk_apartness E); unfold Type_OF_excess_; 
+cases (exc_with1 E); simplify;
+[apply (ap_apart (exc_ap_ E));
+|apply ap_coreflexive;|apply ap_symmetric;|apply ap_cotransitive] 
+qed.
+
+coercion cic:/matita/excess/exc_ap.con.
+
+interpretation "Excess excess_" 'nleq a b =
+ (cic:/matita/excess/exc_excess.con (cic:/matita/excess/excess_base_OF_excess_1.con _) a b).
+
+record excess : Type ≝ {
+  excess_carr:> excess_;
+  ap2exc: ∀y,x:excess_carr. y # x → y ≰ x ∨ x ≰ y;
+  exc2ap: ∀y,x:excess_carr.y ≰ x ∨ x ≰ y →  y # x 
+}.
+
+interpretation "Excess excess" 'nleq a b =
+ (cic:/matita/excess/exc_excess.con (cic:/matita/excess/excess_base_OF_excess1.con _) a b).
+ 
+interpretation "Excess (dual) excess" 'ngeq a b =
+ (cic:/matita/excess/exc_excess.con (cic:/matita/excess/excess_base_OF_excess.con _) a b).
+
+definition strong_ext ≝ λA:apartness.λop:A→A.∀x,y. op x # op y → x # y.
+
+definition le ≝ λE:excess_base.λa,b:E. ¬ (a ≰ b).
+
+interpretation "Excess less or equal than" 'leq a b = 
+ (cic:/matita/excess/le.con (cic:/matita/excess/excess_base_OF_excess1.con _) a b).
+
+interpretation "Excess less or equal than" 'geq a b = 
+ (cic:/matita/excess/le.con (cic:/matita/excess/excess_base_OF_excess.con _) a b).
+
+lemma le_reflexive: ∀E.reflexive ? (le E).
+unfold reflexive; intros 3 (E x H); apply (exc_coreflexive ?? H);
+qed.
+
+lemma le_transitive: ∀E.transitive ? (le E).
+unfold transitive; intros 7 (E x y z H1 H2 H3); cases (exc_cotransitive ??? y H3) (H4 H4);
+[cases (H1 H4)|cases (H2 H4)]
+qed.
 
 definition eq ≝ λA:apartness.λa,b:A. ¬ (a # b).
 
-notation "a break ≈ b" non associative with precedence 50 for @{ 'napart $a $b}.    
-interpretation "alikeness" 'napart a b =
-  (cic:/matita/excess/eq.con _ a b). 
+notation "hvbox(a break ≈ b)" non associative with precedence 50 for @{ 'napart $a $b}.    
+interpretation "Apartness alikeness" 'napart a b = (cic:/matita/excess/eq.con _ a b). 
+interpretation "Excess alikeness" 'napart a b = (cic:/matita/excess/eq.con (cic:/matita/excess/excess_base_OF_excess1.con _) a b). 
+interpretation "Excess (dual) alikeness" 'napart a b = (cic:/matita/excess/eq.con (cic:/matita/excess/excess_base_OF_excess.con _) a b). 
 
-lemma eq_reflexive:∀E. reflexive ? (eq E).
+lemma eq_reflexive:∀E:apartness. reflexive ? (eq E).
 intros (E); unfold; intros (x); apply ap_coreflexive; 
 qed.
 
-lemma eq_sym_:∀E.symmetric ? (eq E).
-intros (E); unfold; intros (x y Exy); unfold; unfold; intros (Ayx); apply Exy;
-apply ap_symmetric; assumption; 
+lemma eq_sym_:∀E:apartness.symmetric ? (eq E).
+unfold symmetric; intros 5 (E x y H H1); cases (H (ap_symmetric ??? H1)); 
 qed.
 
 lemma eq_sym:∀E:apartness.∀x,y:E.x ≈ y → y ≈ x ≝ eq_sym_.
 
+(* SETOID REWRITE *)
 coercion cic:/matita/excess/eq_sym.con.
 
-lemma eq_trans_: ∀E.transitive ? (eq E).
+lemma eq_trans_: ∀E:apartness.transitive ? (eq E).
 (* bug. intros k deve fare whd quanto basta *)
 intros 6 (E x y z Exy Eyz); intro Axy; cases (ap_cotransitive ???y Axy); 
 [apply Exy|apply Eyz] assumption.
@@ -99,23 +152,19 @@ qed.
 lemma eq_trans:∀E:apartness.∀x,z,y:E.x ≈ y → y ≈ z → x ≈ z ≝ 
   λE,x,y,z.eq_trans_ E x z y.
 
-notation > "'Eq'≈" non associative with precedence 50 for
- @{'eqrewrite}.
- 
-interpretation "eq_rew" 'eqrewrite = 
- (cic:/matita/excess/eq_trans.con _ _ _).
+notation > "'Eq'≈" non associative with precedence 50 for @{'eqrewrite}.
+interpretation "eq_rew" 'eqrewrite = (cic:/matita/excess/eq_trans.con _ _ _).
 
-(* BUG: vedere se ricapita *)
 alias id "antisymmetric" = "cic:/matita/constructive_higher_order_relations/antisymmetric.con".
-lemma le_antisymmetric: ∀E.antisymmetric ? (le E) (eq ?).
-intros 5 (E x y Lxy Lyx); intro H;
-cases H; [apply Lxy;|apply Lyx] assumption;
+lemma le_antisymmetric: 
+  ∀E:excess.antisymmetric ? (le (excess_base_OF_excess1 E)) (eq E).
+intros 5 (E x y Lxy Lyx); intro H; 
+cases (ap2exc ??? H); [apply Lxy;|apply Lyx] assumption;
 qed.
 
 definition lt ≝ λE:excess.λa,b:E. a ≤ b ∧ a # b.
 
-interpretation "ordered sets less than" 'lt a b =
- (cic:/matita/excess/lt.con _ a b).
+interpretation "ordered sets less than" 'lt a b = (cic:/matita/excess/lt.con _ a b).
 
 lemma lt_coreflexive: ∀E.coreflexive ? (lt E).
 intros 2 (E x); intro H; cases H (_ ABS); 
@@ -125,43 +174,32 @@ qed.
 lemma lt_transitive: ∀E.transitive ? (lt E).
 intros (E); unfold; intros (x y z H1 H2); cases H1 (Lxy Axy); cases H2 (Lyz Ayz); 
 split; [apply (le_transitive ???? Lxy Lyz)] clear H1 H2;
-cases Axy (H1 H1); cases Ayz (H2 H2); [1:cases (Lxy H1)|3:cases (Lyz H2)]
-clear Axy Ayz;lapply (exc_cotransitive E) as c; unfold cotransitive in c;
-lapply (exc_coreflexive E) as r; unfold coreflexive in r;
-[1: lapply (c ?? y H1) as H3; cases H3 (H4 H4); [cases (Lxy H4)|cases (r ? H4)]
-|2: lapply (c ?? x H2) as H3; cases H3 (H4 H4); [right; assumption|cases (Lxy H4)]]
+elim (ap2exc ??? Axy) (H1 H1); elim (ap2exc ??? Ayz) (H2 H2); [1:cases (Lxy H1)|3:cases (Lyz H2)]
+clear Axy Ayz;lapply (exc_cotransitive (exc_dual_base E)) as c; unfold cotransitive in c;
+lapply (exc_coreflexive (exc_dual_base E)) as r; unfold coreflexive in r;
+[1: lapply (c ?? y H1) as H3; elim H3 (H4 H4); [cases (Lxy H4)|cases (r ? H4)]
+|2: lapply (c ?? x H2) as H3; elim H3 (H4 H4); [apply exc2ap; right; assumption|cases (Lxy H4)]]
 qed.
 
 theorem lt_to_excess: ∀E:excess.∀a,b:E. (a < b) → (b ≰ a).
-intros (E a b Lab); cases Lab (LEab Aab);
-cases Aab (H H); [cases (LEab H)] fold normalize (b ≰ a); assumption; (* BUG *)  
-qed.
-
-lemma unfold_apart: ∀E:excess. ∀x,y:E. x ≰ y ∨ y ≰ x → x # y.
-intros; assumption;
+intros (E a b Lab); elim Lab (LEab Aab);
+elim (ap2exc ??? Aab) (H H); [cases (LEab H)] fold normalize (b ≰ a); assumption; (* BUG *)  
 qed.
 
 lemma le_rewl: ∀E:excess.∀z,y,x:E. x ≈ y → x ≤ z → y ≤ z.
 intros (E z y x Exy Lxz); apply (le_transitive ???? ? Lxz);
-intro Xyz; apply Exy; apply unfold_apart; right; assumption;
+intro Xyz; apply Exy; apply exc2ap; right; assumption;
 qed.
 
 lemma le_rewr: ∀E:excess.∀z,y,x:E. x ≈ y → z ≤ x → z ≤ y.
 intros (E z y x Exy Lxz); apply (le_transitive ???? Lxz);
-intro Xyz; apply Exy; apply unfold_apart; left; assumption;
+intro Xyz; apply Exy; apply exc2ap; left; assumption;
 qed.
 
-notation > "'Le'≪" non associative with precedence 50 for
- @{'lerewritel}.
- 
-interpretation "le_rewl" 'lerewritel = 
- (cic:/matita/excess/le_rewl.con _ _ _).
-
-notation > "'Le'≫" non associative with precedence 50 for
- @{'lerewriter}.
- 
-interpretation "le_rewr" 'lerewriter = 
- (cic:/matita/excess/le_rewr.con _ _ _).
+notation > "'Le'≪" non associative with precedence 50 for @{'lerewritel}.
+interpretation "le_rewl" 'lerewritel = (cic:/matita/excess/le_rewl.con _ _ _).
+notation > "'Le'≫" non associative with precedence 50 for @{'lerewriter}.
+interpretation "le_rewr" 'lerewriter = (cic:/matita/excess/le_rewr.con _ _ _).
 
 lemma ap_rewl: ∀A:apartness.∀x,z,y:A. x ≈ y → y # z → x # z.
 intros (A x z y Exy Ayz); cases (ap_cotransitive ???x Ayz); [2:assumption]
@@ -173,39 +211,26 @@ intros (A x z y Exy Azy); apply ap_symmetric; apply (ap_rewl ???? Exy);
 apply ap_symmetric; assumption;
 qed.
 
-notation > "'Ap'≪" non associative with precedence 50 for
- @{'aprewritel}.
- 
-interpretation "ap_rewl" 'aprewritel = 
- (cic:/matita/excess/ap_rewl.con _ _ _).
-
-notation > "'Ap'≫" non associative with precedence 50 for
- @{'aprewriter}.
- 
-interpretation "ap_rewr" 'aprewriter = 
- (cic:/matita/excess/ap_rewr.con _ _ _).
+notation > "'Ap'≪" non associative with precedence 50 for @{'aprewritel}.
+interpretation "ap_rewl" 'aprewritel = (cic:/matita/excess/ap_rewl.con _ _ _).
+notation > "'Ap'≫" non associative with precedence 50 for @{'aprewriter}.
+interpretation "ap_rewr" 'aprewriter = (cic:/matita/excess/ap_rewr.con _ _ _).
 
+alias symbol "napart" = "Apartness alikeness".
 lemma exc_rewl: ∀A:excess.∀x,z,y:A. x ≈ y → y ≰ z → x ≰ z.
 intros (A x z y Exy Ayz); elim (exc_cotransitive ???x Ayz); [2:assumption]
-cases Exy; right; assumption;
+cases Exy; apply exc2ap; right; assumption;
 qed.
   
 lemma exc_rewr: ∀A:excess.∀x,z,y:A. x ≈ y → z ≰ y → z ≰ x.
 intros (A x z y Exy Azy); elim (exc_cotransitive ???x Azy); [assumption]
-elim (Exy); left; assumption;
+elim (Exy); apply exc2ap; left; assumption;
 qed.
 
-notation > "'Ex'≪" non associative with precedence 50 for
- @{'excessrewritel}.
- 
-interpretation "exc_rewl" 'excessrewritel = 
- (cic:/matita/excess/exc_rewl.con _ _ _).
-
-notation > "'Ex'≫" non associative with precedence 50 for
- @{'excessrewriter}.
- 
-interpretation "exc_rewr" 'excessrewriter = 
- (cic:/matita/excess/exc_rewr.con _ _ _).
+notation > "'Ex'≪" non associative with precedence 50 for @{'excessrewritel}.
+interpretation "exc_rewl" 'excessrewritel = (cic:/matita/excess/exc_rewl.con _ _ _).
+notation > "'Ex'≫" non associative with precedence 50 for @{'excessrewriter}.
+interpretation "exc_rewr" 'excessrewriter = (cic:/matita/excess/exc_rewr.con _ _ _).
 
 lemma lt_rewr: ∀A:excess.∀x,z,y:A. x ≈ y → z < y → z < x.
 intros (A x y z E H); split; elim H; 
@@ -217,44 +242,38 @@ intros (A x y z E H); split; elim H;
 [apply (Le≪ ? (eq_sym ??? E));| apply (Ap≪ ? E);] assumption;
 qed.
 
-notation > "'Lt'≪" non associative with precedence 50 for
- @{'ltrewritel}.
- 
-interpretation "lt_rewl" 'ltrewritel = 
- (cic:/matita/excess/lt_rewl.con _ _ _).
-
-notation > "'Lt'≫" non associative with precedence 50 for
- @{'ltrewriter}.
- 
-interpretation "lt_rewr" 'ltrewriter = 
- (cic:/matita/excess/lt_rewr.con _ _ _).
+notation > "'Lt'≪" non associative with precedence 50 for @{'ltrewritel}.
+interpretation "lt_rewl" 'ltrewritel = (cic:/matita/excess/lt_rewl.con _ _ _).
+notation > "'Lt'≫" non associative with precedence 50 for @{'ltrewriter}.
+interpretation "lt_rewr" 'ltrewriter = (cic:/matita/excess/lt_rewr.con _ _ _).
 
 lemma lt_le_transitive: ∀A:excess.∀x,y,z:A.x < y → y ≤ z → x < z.
 intros (A x y z LT LE); cases LT (LEx APx); split; [apply (le_transitive ???? LEx LE)]
-whd in LE LEx APx; cases APx (EXx EXx); [cases (LEx EXx)]
+apply exc2ap; cases (ap2exc ??? APx) (EXx EXx); [cases (LEx EXx)]
 cases (exc_cotransitive ??? z EXx) (EXz EXz); [cases (LE EXz)]
 right; assumption;
 qed.
 
 lemma le_lt_transitive: ∀A:excess.∀x,y,z:A.x ≤ y → y < z → x < z.
 intros (A x y z LE LT); cases LT (LEx APx); split; [apply (le_transitive ???? LE LEx)]
-whd in LE LEx APx; cases APx (EXx EXx); [cases (LEx EXx)]
-cases (exc_cotransitive ??? x EXx) (EXz EXz); [right; assumption]
+elim (ap2exc ??? APx) (EXx EXx); [cases (LEx EXx)]
+elim (exc_cotransitive ??? x EXx) (EXz EXz); [apply exc2ap; right; assumption]
 cases LE; assumption;
 qed.
     
 lemma le_le_eq: ∀E:excess.∀a,b:E. a ≤ b → b ≤ a → a ≈ b.
-intros (E x y L1 L2); intro H; cases H; [apply L1|apply L2] assumption;
+intros (E x y L1 L2); intro H; cases (ap2exc ??? H); [apply L1|apply L2] assumption;
 qed.
 
 lemma eq_le_le: ∀E:excess.∀a,b:E. a ≈ b → a ≤ b ∧ b ≤ a.
-intros (E x y H); unfold apart_of_excess in H; unfold apart in H;
-simplify in H; split; intro; apply H; [left|right] assumption.
+intros (E x y H); whd in H;
+split; intro; apply H; apply exc2ap; [left|right] assumption.
 qed.
 
 lemma ap_le_to_lt: ∀E:excess.∀a,c:E.c # a → c ≤ a → c < a.
 intros; split; assumption;
 qed.
 
-definition total_order_property : ∀E:excess. Type ≝
+definition total_order_property : ∀E:excess. Type ≝ 
   λE:excess. ∀a,b:E. a ≰ b → b < a.
+