simplified coercDb implementation with additional info about the position of

[helm.git] / helm / software / matita / contribs / dama / dama / models / nat_dedekind_sigma_complete.ma

diff --git a/helm/software/matita/contribs/dama/dama/models/nat_dedekind_sigma_complete.ma b/helm/software/matita/contribs/dama/dama/models/nat_dedekind_sigma_complete.ma
index bc009b5c6fc6bcdb67dee6c63d84ddd7e819eed4..2206017452995e0bc2d815dd0244da9838a1ddae 100644 (file)
--- a/helm/software/matita/contribs/dama/dama/models/nat_dedekind_sigma_complete.ma
+++ b/helm/software/matita/contribs/dama/dama/models/nat_dedekind_sigma_complete.ma
@@ -17,17 +17,6 @@ include "supremum.ma".
 include "nat/le_arith.ma".
 include "russell_support.ma".
 
-inductive cmp_cases (n,m:nat) : CProp ≝
-  | cmp_lt : n < m → cmp_cases n m
-  | cmp_eq : n = m → cmp_cases n m
-  | cmp_gt : m < n → cmp_cases n m.
-  
-lemma cmp_nat: ∀n,m.cmp_cases n m.
-intros; generalize in match (nat_compare_to_Prop n m);
-cases (nat_compare n m); intros;
-[constructor 1|constructor 2|constructor 3] assumption;
-qed.
-
 alias symbol "pi1" = "exT \fst".
 alias symbol "leq" = "natural 'less or equal to'".
 lemma nat_dedekind_sigma_complete:
@@ -68,7 +57,7 @@ letin m ≝ (hide ? (
         apply le_plus_n_r;] 
 |2,3: clear H6;
     cases (aux n1) in H5 ⊢ %; intros;
-    change in match (a â\8c©w,H5â\8cª) in H6 ⊢ % with (a w);
+    change in match (a â\89ªw,H5â\89«) in H6 ⊢ % with (a w);
     cases H5; clear H5; cases H7; clear H7;
     [1: left; split; [ apply (le_S ?? H5); | assumption]
     |3: cases (?:False); rewrite < H8 in H6; apply (not_le_Sn_n ? H6);