Return-Path: <john.harrison-request@uk.ac.cam.cl>
Delivery-Date: 
Received: from ted.cs.uidaho.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.4); Fri, 1 Jan 1993 11:31:46 +0000
Received: by ted.cs.uidaho.edu (16.6/1.34) id AA16713;
          Fri, 1 Jan 93 03:14:48 -0800
Sender: info-hol-request@edu.uidaho.cs.ted
Errors-To: info-hol-request@edu.uidaho.cs.ted
Precedence: bulk
Received: from moa.pmms.cam.ac.uk by ted.cs.uidaho.edu (16.6/1.34) id AA16708;
          Fri, 1 Jan 93 03:14:39 -0800
Received: by moa.pmms.cam.ac.uk (UK-Smail 3.1.25.1/1); Fri, 1 Jan 93 11:13 GMT
Message-Id: <m0n7kJR-0000d0C@moa.pmms.cam.ac.uk>
Date: Fri, 1 Jan 93 11:13 GMT
From: Thomas Forster <T.Forster@uk.ac.cam.pmms>
To: info-hol@edu.uidaho.cs.ted, toal@edu.ucla.cs
Subject: Re: Intersection of Nothing

    What is `obvious' is that \bigcap P is a subset of any member of P.  So,
{\sl as long as P is nonempty} we can reason in ZF (or even in Zermelo set
theory - we do not need replacement) as follows:
      Think of any member y of P, it doesn't matter which.  \bigcap P is a subset
of y, and so is a set by aussonderung, comprehension, call it what you like.
Formally we have 
$$\bigcap P = \{x \in y:(\forall z \in P)(x \in z)\}$$
(aussonderung, comprehension etc is the scheme that says that $\{x \in y: \phi\}$ is a set
for all y and all \phi.)   So \bigcap P is a set.  
    Clearly this proof depends on there being a y in P.  If P is empty this proof
doesn't work.  And we'd better hope no other proof works either beco's if it did,
Zermelo set theory would be inconsistent and then the sky would fall in.

       Thomas Forster
