-(* In this Chapter we shall develop a naif theory of sets represented as
+(*
+\ 5h1 class="section"\ 6Naif Set Theory\ 5/h1\ 6
+*)
+In this Chapter we shall develop a naif theory of sets represented as
characteristic predicates over some universe \ 5code\ 6A\ 5/code\ 6, that is as objects of type
A→Prop. *)
include "basics/types.ma".
include "basics/bool.ma".
-(**** For instance the empty set is defined by the always function predicate *)
+(* For instance the empty set is defined by the always false function: *)
definition empty_set ≝ λA:Type[0].λa:A.\ 5a href="cic:/matita/basics/logic/False.ind(1,0,0)"\ 6False\ 5/a\ 6.
notation "\emptyv" non associative with precedence 90 for @{'empty_set}.