\documentstyle[12pt]{article}

\voffset=-3.0cm
\hoffset=-2.6cm
\textwidth=17.5cm
\textheight=24cm

\renewcommand{\not}{\neg}
\renewcommand{\and}{\wedge}
\renewcommand{\or}{\vee}
\newcommand{\impl}{\Rightarrow}
\newcommand{\lequiv}{\Leftrightarrow}
\newcommand{\all}{\forall}
\newcommand{\exi}{\exists}
\newcommand{\elc}{\models}  % semantic logical consequence
\newcommand{\ylc}{\vdash}  % syntactic logical consequence
\newcommand{\union}{\cup}
\newcommand{\intersect}{\cap}


\pagestyle{empty}

\begin{document}

{\bf Logic 1, WS 2004.
Homework 6, given Dec 02, due Dec 09}

\bigskip

\noindent
Prove in informal style, using the basic properties of sets and the inference
rules which you consider appropriate:
$${\cal P}(A) = \{ P | P \subseteq A \}$$
{\centerline {\bf iff}}
$${\cal P}[\emptyset] = \{ \emptyset \}\ \and\ 
((A \neq \emptyset) \impl (\forall_{a \in A} 
   \forall_P (P = {\cal P}(A\setminus\{a\})\ \impl\ 
   {\cal P}(A) = P \cup \{ B \cup \{a\} | B \in P \}))).
$$

\end{document}
