let T be non empty discrete TopSpace; :: thesis: ( T is separable iff card ([#] T) c= omega )
hereby :: thesis: ( card ([#] T) c= omega implies T is separable ) end;
assume card ([#] T) c= omega ; :: thesis: T is separable
then T is countable by TOPGEN_1:2;
hence T is separable ; :: thesis: verum