(* subset top (full subset) *)
definition stop ≝ λD:Domain. true_f D.
+coercion stop.
+
(* subset bottom (empty subset) *)
definition sbot ≝ λD:Domain. false_f D.
definition sover: ∀D. Subset D → Subset D → Prop ≝
λD,U1,U2. \iexists d. U1 d ∧ U2 d.
-(* coercions **************************************************************)
-
-(*
-(* the class of the subsets of a domain (not an implicit coercion) *)
-definition class_of_subsets_of \def
- \lambda D. mk_Class (Subset D) (true_f ?) (sle ?).
-*)
+(* the class of the subsets of a domain *)
+definition subsets_of_domain ≝
+ λD. mk_Class (Subset D) (true_f ?) (sle ?).
-(* the domain built upon a subset (not an implicit coercion) *)
-definition domain_of_subset: ∀D. Subset D \to Domain ≝
+(* the domain built upon a subset *)
+definition domain_of_subset: ∀D. Subset D → Domain ≝
λD:Domain. λU. mk_Domain (mk_Class D (sin D U) (ces D)).
-
-(* the full subset of a domain *)
-coercion stop.