HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem notzfaus 2736
Description: In the Separation Scheme zfauscl 2700, we require that y not occur in ph (which can be generalized to "not be free in"). Here we show that a contradiction can result if we omit this requirement.
Hypotheses
Ref Expression
notzfaus.1 |- A = {(/)}
notzfaus.2 |- (ph <-> -. x e. y)
Assertion
Ref Expression
notzfaus |- -. E.yA.x(x e. y <-> (x e. A /\ ph))
Distinct variable group:   x,A

Proof of Theorem notzfaus
StepHypRef Expression
1 0ex 2706 . . . . . . 7 |- (/) e. V
21snnz 2454 . . . . . 6 |- {(/)} =/= (/)
3 notzfaus.1 . . . . . . 7 |- A = {(/)}
43neeq1i 1589 . . . . . 6 |- (A =/= (/) <-> {(/)} =/= (/))
52, 4mpbir 190 . . . . 5 |- A =/= (/)
6 ne0 2284 . . . . 5 |- (A =/= (/) <-> E.x x e. A)
75, 6mpbi 189 . . . 4 |- E.x x e. A
8 biimt 730 . . . . . . 7 |- (x e. A -> (x e. y <-> (x e. A -> x e. y)))
9 iman 237 . . . . . . . 8 |- ((x e. A -> x e. y) <-> -. (x e. A /\ -. x e. y))
10 notzfaus.2 . . . . . . . . . 10 |- (ph <-> -. x e. y)
1110anbi2i 480 . . . . . . . . 9 |- ((x e. A /\ ph) <-> (x e. A /\ -. x e. y))
1211negbii 187 . . . . . . . 8 |- (-. (x e. A /\ ph) <-> -. (x e. A /\ -. x e. y))
139, 12bitr4 176 . . . . . . 7 |- ((x e. A -> x e. y) <-> -. (x e. A /\ ph))
148, 13syl6bb 535 . . . . . 6 |- (x e. A -> (x e. y <-> -. (x e. A /\ ph)))
15 xor3 673 . . . . . 6 |- (-. (x e. y <-> (x e. A /\ ph)) <-> (x e. y <-> -. (x e. A /\ ph)))
1614, 15sylibr 200 . . . . 5 |- (x e. A -> -. (x e. y <-> (x e. A /\ ph)))
171619.22i 1038 . . . 4 |- (E.x x e. A -> E.x -. (x e. y <-> (x e. A /\ ph)))
187, 17ax-mp 7 . . 3 |- E.x -. (x e. y <-> (x e. A /\ ph))
19 exnal 1036 . . 3 |- (E.x -. (x e. y <-> (x e. A /\ ph)) <-> -. A.x(x e. y <-> (x e. A /\ ph)))
2018, 19mpbi 189 . 2 |- -. A.x(x e. y <-> (x e. A /\ ph))
2120nex 1099 1 |- -. E.yA.x(x e. y <-> (x e. A /\ ph))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  A.wal 952   = wceq 954   e. wcel 956  E.wex 978   =/= wne 1582  (/)c0 2276  {csn 2405
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-nul 2705
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-v 1808  df-dif 2045  df-un 2046  df-nul 2277  df-sn 2408  df-pr 2409
Copyright terms: Public domain