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

Theorem r19.22d 1276
Description: Deduction from Theorem 19.22 of [Margaris] p. 90. (Restricted quantifier version.)
Hypotheses
Ref Expression
r19.22d.1 |- (ph -> A.xph)
r19.22d.2 |- (ph -> (x e. A -> (ps -> ch)))
Assertion
Ref Expression
r19.22d |- (ph -> (E.x e. A ps -> E.x e. A ch))

Proof of Theorem r19.22d
StepHypRef Expression
1 r19.22d.1 . . 3 |- (ph -> A.xph)
2 r19.22d.2 . . 3 |- (ph -> (x e. A -> (ps -> ch)))
31, 2r19.21ai 1258 . 2 |- (ph -> A.x e. A (ps -> ch))
4 r19.22 1272 . 2 |- (A.x e. A (ps -> ch) -> (E.x e. A ps -> E.x e. A ch))
53, 4syl 12 1 |- (ph -> (E.x e. A ps -> E.x e. A ch))
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   e. wcel 1092  A.wral 1201  E.wrex 1202
This theorem is referenced by:  r19.22dv 1278  ss2iun 2005  chfnrn 2885  tz7.49 2997  r1tr 3498
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-gen 677
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-ral 1205  df-rex 1206
metamath.org