Great: some significant progress in fixing universe levels.

[helm.git] / helm / software / matita / contribs / formal_topology / overlap / categories.ma

diff --git a/helm/software/matita/contribs/formal_topology/overlap/categories.ma b/helm/software/matita/contribs/formal_topology/overlap/categories.ma
index 67db8176c9673a08ebd57e10f4266414df8063cf..3a7614fca8b652e8668375d3bc1024bc6b3166a4 100644 (file)
--- a/helm/software/matita/contribs/formal_topology/overlap/categories.ma
+++ b/helm/software/matita/contribs/formal_topology/overlap/categories.ma
@@ -12,36 +12,7 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "logic/cprop_connectives.ma".
-
-definition Type0 := Type.
-definition Type1 := Type.
-definition Type2 := Type.
-definition Type3 := Type.
-definition Type0_lt_Type1 := (Type0 : Type1).
-definition Type1_lt_Type2 := (Type1 : Type2).
-definition Type2_lt_Type3 := (Type2 : Type3).
-
-definition Type_OF_Type0: Type0 → Type := λx.x.
-definition Type_OF_Type1: Type1 → Type := λx.x.
-definition Type_OF_Type2: Type2 → Type := λx.x.
-definition Type_OF_Type3: Type3 → Type := λx.x.
-coercion Type_OF_Type0.
-coercion Type_OF_Type1.
-coercion Type_OF_Type2.
-coercion Type_OF_Type3.
-
-definition CProp0 := Type0.
-definition CProp1 := Type1.
-definition CProp2 := Type2.
-(*
-definition CProp0_lt_CProp1 := (CProp0 : CProp1).
-definition CProp1_lt_CProp2 := (CProp1 : CProp2).
-
-definition CProp_OF_CProp0: CProp0 → CProp := λx.x.
-definition CProp_OF_CProp1: CProp1 → CProp := λx.x.
-definition CProp_OF_CProp2: CProp2 → CProp := λx.x.
-*)
+include "cprop_connectives.ma".
 
 record equivalence_relation (A:Type0) : Type1 ≝
  { eq_rel:2> A → A → CProp0;
@@ -194,8 +165,8 @@ definition CPROP: setoid1.
   | constructor 1;
      [ apply Iff
      | intros 1; split; intro; assumption
-     | intros 3; cases H; split; assumption
-     | intros 5; cases H; cases H1; split; intro;
+     | intros 3; cases i; split; assumption
+     | intros 5; cases i; cases i1; split; intro;
         [ apply (f2 (f x1)) | apply (f1 (f3 z1))]]]
 qed.
 
@@ -210,10 +181,10 @@ interpretation "if" 'if r = (if' __ r).
 definition and_morphism: binary_morphism1 CPROP CPROP CPROP.
  constructor 1;
   [ apply And
-  | intros; split; intro; cases H; split;
-     [ apply (if ?? e a1)
+  | intros; split; intro; cases a1; split;
+     [ apply (if ?? e a2)
      | apply (if ?? e1 b1)
-     | apply (fi ?? e a1)
+     | apply (fi ?? e a2)
      | apply (fi ?? e1 b1)]]
 qed.
 
@@ -222,7 +193,7 @@ interpretation "and_morphism" 'and a b = (fun21 ___ and_morphism a b).
 definition or_morphism: binary_morphism1 CPROP CPROP CPROP.
  constructor 1;
   [ apply Or
-  | intros; split; intro; cases H; [1,3:left |2,4: right]
+  | intros; split; intro; cases o; [1,3:left |2,4: right]
      [ apply (if ?? e a1)
      | apply (fi ?? e a1)
      | apply (if ?? e1 b1)