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

Theorem zfpow 3482
Description: Axiom of Power Sets expressed with fewest number of different variables.
Assertion
Ref Expression
zfpow |- E.xA.y(A.x(x e. y -> x e. z) -> y e. x)
Distinct variable group:   x,y,z

Proof of Theorem zfpow
StepHypRef Expression
1 ax-pow 3481 . 2 |- E.xA.y(A.w(w e. y -> w e. z) -> y e. x)
2 elequ1 1496 . . . . . . 7 |- (w = x -> (w e. y <-> x e. y))
3 elequ1 1496 . . . . . . 7 |- (w = x -> (w e. z <-> x e. z))
42, 3imbi12d 688 . . . . . 6 |- (w = x -> ((w e. y -> w e. z) <-> (x e. y -> x e. z)))
54cbvalv 1696 . . . . 5 |- (A.w(w e. y -> w e. z) <-> A.x(x e. y -> x e. z))
65imbi1i 203 . . . 4 |- ((A.w(w e. y -> w e. z) -> y e. x) <-> (A.x(x e. y -> x e. z) -> y e. x))
76albii 1346 . . 3 |- (A.y(A.w(w e. y -> w e. z) -> y e. x) <-> A.y(A.x(x e. y -> x e. z) -> y e. x))
87exbii 1398 . 2 |- (E.xA.y(A.w(w e. y -> w e. z) -> y e. x) <-> E.xA.y(A.x(x e. y -> x e. z) -> y e. x))
91, 8mpbi 206 1 |- E.xA.y(A.x(x e. y -> x e. z) -> y e. x)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 1296   = wceq 1298   e. wcel 1300  E.wex 1326
This theorem is referenced by:  el 3485  pwexOLD 3488  axpowndlem2 6102
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-12 1310  ax-13 1311  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-pow 3481
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327
Copyright terms: Public domain