>>16770307
>whine whine
yawn
Could you do this, instead of calling me names I don't care about: show any statement X such that ZF+foundation proves X and ZF without foundation assumed doesn't, where X is an arithmetical statement in the following sense:
Let c be any letter, we define c-formulas by induction:
(1) for any variables x, y different to c,"x belongs to y" and "x = y" are c-formulas
(2) for any c-formulas A,B, ~A and A/\B are also c-formulas
(3), for any c-formula and any letter x different to c, "exists x, (x belongs to c) /\ D" is a c-formula.
Let P a formula with one free variable x equivalent (in ZF without foundation assumed, which does not mean it assumes its negation) to the claim "x is equal to V_w, where w is the first infinite ordinal". In the above, an "arithmetical statement" is defined as a formula of type "exists c; P[x:=c] /\ F" where F is any c-formula without free variables.
NB: I have nothing against antifoundation axioms but it is a separate topic consistying of ZF without foundation assumed, ***but with extra other axioms*** (which may prove additional arithmetical statements).