coercion qd.
(* internal universal quantification *)
-inductive iall (D:Domain) (P:D \to Prop) : Prop \def
- | iall_intro: (\forall d:D. cin D d \to P d) \to iall D P.
+inductive dall (D:Domain) (P:D \to Prop) : Prop \def
+ | dall_intro: (\forall d:D. cin D d \to P d) \to dall D P.
(* internal existential quantification *)
-inductive iex (D:Domain) (P:D \to Prop) : Prop \def
- | iex_intro: \forall d:D. cin D d \land P d \to iex D P.
-(*
+inductive dex (D:Domain) (P:D \to Prop) : Prop \def
+ | dex_intro: \forall d:D. cin D d \land P d \to dex D P.
+
(* notations **************************************************************)
(*CSC: the URI must disappear: there is a bug now *)
-interpretation "internal for all" 'iall \eta.x =
- (cic:/matita/PREDICATIVE-TOPOLOGY/domain_defs/iall.ind#xpointer(1/1) _ x).
+interpretation "internal for all" 'iforall \eta.x =
+ (cic:/matita/PREDICATIVE-TOPOLOGY/domain_defs/dall.ind#xpointer(1/1) _ x).
-notation < "hvbox(\iall ident i opt (: ty) break . p)"
+notation > "hvbox(\iforall ident i opt (: ty) break . p)"
right associative with precedence 20
-for @{ 'iall ${default
+for @{ 'iforall ${default
@{\lambda ${ident i} : $ty. $p)}
@{\lambda ${ident i} . $p}}}.
(*CSC: the URI must disappear: there is a bug now *)
-interpretation "internal exist" 'iexist \eta.x =
- (cic:/matita/PREDICATIVE-TOPOLOGY/domain_defs/iex.ind#xpointer(1/1) _ x).
+interpretation "internal exists" 'dexists \eta.x =
+ (cic:/matita/PREDICATIVE-TOPOLOGY/domain_defs/dex.ind#xpointer(1/1) _ x).
-notation < "hvbox(\iexist ident i opt (: ty) break . p)"
+notation > "hvbox(\iexists ident i opt (: ty) break . p)"
right associative with precedence 20
-for @{ 'iexist ${default
+for @{ 'dexists ${default
@{\lambda ${ident i} : $ty. $p)}
@{\lambda ${ident i} . $p}}}.
-*)
\ No newline at end of file
(* subset less or equal (inclusion) *)
definition sle: \forall D. Subset D \to Subset D \to Prop \def
- \lambda D,U1,U2. \forall d. U1 d \to U2 d.
-(*
+ \lambda D,U1,U2. \iforall d. U1 d \to U2 d.
+
(* subset overlap *)
definition sover: \forall D. Subset D \to Subset D \to Prop \def
- \lambda D,U1,U2. \forall d. U1 d \to U2 d.
-*)
+ \lambda D,U1,U2. \iexists d. U1 d \land U2 d.
(* coercions **************************************************************)
(* the full subset of a domain *)
coercion stop.
-