Hi everybody, can someone please help with this?
By a graph we shall here understand the graph of a function in . The paving in [0, 1] × [0, 1] = of all graphs is denoted G. By a full set we shall here understand a subset A [0, 1] × [0, 1] with full projection on the first axes in the sense that for every x [0, 1] there exists y [0, 1] such that (x, y) A. The paving in [0, 1] × [0, 1] of all full sets is denoted F.
Determine the cardinalities of the sets G and F. Show that no set in G can intersect every set in F.