```Date: Feb 22, 2013 3:38 PM
Author: Zaljohar@gmail.com
Subject: Re: An equivalent of MK-Foundation-Choice

On Feb 22, 10:23 pm, Charlie-Boo <shymath...@gmail.com> wrote:> On Feb 22, 5:14 am, Zuhair <zaljo...@gmail.com> wrote:>>>>>>>>>> > On Feb 21, 11:10 pm, Charlie-Boo <shymath...@gmail.com> wrote:>> > > On Feb 20, 6:01 pm, Zuhair <zaljo...@gmail.com> wrote:>> > > > This is just a cute result.>> > > > The following theory is equal to MK-Foundation-Choice>> > > > Language: FOL(=,e)>> > > > Define: Set(x) iff Ey. x e y>> > > > Axioms: ID axioms+>> > > > 1.Extensionality: (Az. z e x <-> z e y) -> x=y>> > > > 2. Construction: if phi is a formula in which x is not free,> > > > then (ExAy.y e x<->Set(y)&phi) is an axiom>> > > > 3. Pairing: (Ay. y e x -> y=a or y=b) -> Set(x)>> > > > 4. Size limitation> > > > Set(x) <-> Ey. y is set sized & Azex(Emey(z<<m))>> > > > where y is set sized iff Es. Set(s) & y =< s> > > > and z<<m iff z =<m & AneTC(z).n =<m>> > > > TC(z) stands for 'transitive closure of z' defined in the usual manner> > > > as the minimal transitive class having z as subclass of; transitive of> > > > course defined as a class having all its members as subsets of it.>> > > > y =< s iff Exist f. f:y-->s & f is injective.>> > > > />> > > > Of course this theory PROVES the consistency of ZFC.> > > > Proofs had all been worked up in detail. It is an enjoying experience> > > > to try figure them out.>> > > Why don't you supply your proof of ZFC consistency in detail then?  If> > > that is too much, then why not give it for 2 potentially conflicting> > > axioms in detail, as I suggested recently?>> > > Why waste space with unsubstantiated claims of grandeur?>> > > C-B>> > > > Zuhair>> > Of course I'll supply them in DETAIL. There is no grandeur, nothing> > like that. That matter has been PROVED. I just wanted some to enjoy>> What has been proved?>> > figuring it out before I send the whole written proof.>> What are you waiting for?>> I'll bet you \$25 to your \$1 that you don't supply a proof, payable via> PayPal.  Are we on?  Only condition is you have to answer every> question - no obfuscation, please.>> It'd be well worth \$25 if you have a proof of ZF consistency and I was> one of the first to be able to give it.  Has it been proven before?> It seems people say "if ZF were consistent".  Who has tried?  Does> Gödel's 2nd Theorem mean you'll do math that ZF can't?>> C-B>>>>>>>> > ZuhairThere is some confusion here. What I'm claiming is that IF we holdthat theory presented here to be consistent then MK minus foundationminus choice would be consistent, and thus ZFC would be provedconsistent. I'm speaking about a relative consistency proof here.Zuhair
```