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

Theorem axnul2 2763
Description: Prove axnul 2764 directly from ax-rep 2748 without using any equality axioms (ax-9 1006 thru ax-16 1252). The wff x = x substituted for ph in the ax-rep 2748 instance is arbitrary. Here, we don't need to know if x = x is true or false, only that it's not both. (Contributed by Jeff Hoffman, 4-Feb-2008.)
Assertion
Ref Expression
axnul2 |- E.xA.y -. y e. x
Distinct variable group:   x,y

Proof of Theorem axnul2
StepHypRef Expression
1 ax-rep 2748 . . 3 |- (A.wE.xA.y(A.x(x = x <-> -. x = x) -> y = x) -> E.xA.y(y e. x <-> E.w(w e. z /\ A.x(x = x <-> -. x = x))))
2 pm5.19 680 . . . . . . . . 9 |- -. (x = x <-> -. x = x)
3 ax-4 1014 . . . . . . . . 9 |- (A.x(x = x <-> -. x = x) -> (x = x <-> -. x = x))
42, 3mto 112 . . . . . . . 8 |- -. A.x(x = x <-> -. x = x)
54intnan 703 . . . . . . 7 |- -. (w e. z /\ A.x(x = x <-> -. x = x))
65nex 1142 . . . . . 6 |- -. E.w(w e. z /\ A.x(x = x <-> -. x = x))
76nbn 734 . . . . 5 |- (-. y e. x <-> (y e. x <-> E.w(w e. z /\ A.x(x = x <-> -. x = x))))
87albii 1040 . . . 4 |- (A.y -. y e. x <-> A.y(y e. x <-> E.w(w e. z /\ A.x(x = x <-> -. x = x))))
98exbii 1092 . . 3 |- (E.xA.y -. y e. x <-> E.xA.y(y e. x <-> E.w(w e. z /\ A.x(x = x <-> -. x = x))))
101, 9sylibr 207 . 2 |- (A.wE.xA.y(A.x(x = x <-> -. x = x) -> y = x) -> E.xA.y -. y e. x)
11 19.8a 1070 . . 3 |- (A.y(A.x(x = x <-> -. x = x) -> y = x) -> E.xA.y(A.x(x = x <-> -. x = x) -> y = x))
124pm2.21i 80 . . 3 |- (A.x(x = x <-> -. x = x) -> y = x)
1311, 12mpg 1027 . 2 |- E.xA.y(A.x(x = x <-> -. x = x) -> y = x)
1410, 13mpg 1027 1 |- E.xA.y -. y e. x
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 153   /\ wa 230  A.wal 995   = wceq 997   e. wcel 999  E.wex 1021
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1004  ax-4 1014  ax-5o 1016  ax-rep 2748
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-ex 1022
Copyright terms: Public domain