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

Theorem r19.35 1751
Description: Restricted quantifier version of Theorem 19.35 of [Margaris] p. 90.
Assertion
Ref Expression
r19.35 |- (E.x e. A (ph -> ps) <-> (A.x e. A ph -> E.x e. A ps))

Proof of Theorem r19.35
StepHypRef Expression
1 r19.26 1742 . . . 4 |- (A.x e. A (ph /\ -. ps) <-> (A.x e. A ph /\ A.x e. A -. ps))
2 annim 238 . . . . 5 |- ((ph /\ -. ps) <-> -. (ph -> ps))
32ralbii 1659 . . . 4 |- (A.x e. A (ph /\ -. ps) <-> A.x e. A -. (ph -> ps))
4 df-an 225 . . . 4 |- ((A.x e. A ph /\ A.x e. A -. ps) <-> -. (A.x e. A ph -> -. A.x e. A -. ps))
51, 3, 43bitr3 181 . . 3 |- (A.x e. A -. (ph -> ps) <-> -. (A.x e. A ph -> -. A.x e. A -. ps))
65con2bii 221 . 2 |- ((A.x e. A ph -> -. A.x e. A -. ps) <-> -. A.x e. A -. (ph -> ps))
7 dfrex2 1648 . . 3 |- (E.x e. A ps <-> -. A.x e. A -. ps)
87imbi2i 185 . 2 |- ((A.x e. A ph -> E.x e. A ps) <-> (A.x e. A ph -> -. A.x e. A -. ps))
9 dfrex2 1648 . 2 |- (E.x e. A (ph -> ps) <-> -. A.x e. A -. (ph -> ps))
106, 8, 93bitr4r 184 1 |- (E.x e. A (ph -> ps) <-> (A.x e. A ph -> E.x e. A ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  A.wral 1637  E.wrex 1638
This theorem is referenced by:  r19.36av 1752  r19.37av 1753  r19.37zv 2341  r19.36zv 2344  bndndx 6020  metcnp4 7904  nmobndseqi 8372  faimpex 10339
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-4 970  ax-5o 972
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-ral 1641  df-rex 1642
Copyright terms: Public domain