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

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

Proof of Theorem axpow
StepHypRef Expression
1 ax-pow 2737 . 2 |- E.xA.y(A.w(w e. y -> w e. z) -> y e. x)
2 elequ1 1134 . . . . . . 7 |- (w = x -> (w e. y <-> x e. y))
3 elequ1 1134 . . . . . . 7 |- (w = x -> (w e. z <-> x e. z))
42, 3imbi12d 625 . . . . . 6 |- (w = x -> ((w e. y -> w e. z) <-> (x e. y -> x e. z)))
54cbvalv 1312 . . . . 5 |- (A.w(w e. y -> w e. z) <-> A.x(x e. y -> x e. z))
65imbi1i 186 . . . 4 |- ((A.w(w e. y -> w e. z) -> y e. x) <-> (A.x(x e. y -> x e. z) -> y e. x))
76albii 997 . . 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 1049 . 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 189 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 952   = wceq 954   e. wcel 956  E.wex 978
This theorem is referenced by:  pwex 2740  axpowndlem2 4930
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-12 966  ax-13 967  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-pow 2737
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 979
Copyright terms: Public domain