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

Theorem r19.36av 1299
Description: One direction of a restricted quantifier version of Theorem 19.36 of [Margaris] p. 90. The other direction doesn't hold when A is empty.
Assertion
Ref Expression
r19.36av |- (E.x e. A (ph -> ps) -> (A.x e. A ph -> ps))
Distinct variable group(s):   ps,x

Proof of Theorem r19.36av
StepHypRef Expression
1 r19.35 1298 . 2 |- (E.x e. A (ph -> ps) <-> (A.x e. A ph -> E.x e. A ps))
2 idd 11 . . . 4 |- (x e. A -> (ps -> ps))
32r19.23aiv 1284 . . 3 |- (E.x e. A ps -> ps)
43syl3 18 . 2 |- ((A.x e. A ph -> E.x e. A ps) -> (A.x e. A ph -> ps))
51, 4sylbi 174 1 |- (E.x e. A (ph -> ps) -> (A.x e. A ph -> ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   e. wcel 1092  A.wral 1201  E.wrex 1202
This theorem is referenced by:  iinss 2025
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-17 925
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-ral 1205  df-rex 1206
metamath.org