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

Theorem 19.23ad 1066
Description: Deduction from Theorem 19.23 of [Margaris] p. 90.
Hypotheses
Ref Expression
19.23ad.1 |- (ph -> A.xph)
19.23ad.2 |- (ch -> A.xch)
19.23ad.3 |- (ph -> (ps -> ch))
Assertion
Ref Expression
19.23ad |- (ph -> (E.xps -> ch))

Proof of Theorem 19.23ad
StepHypRef Expression
1 19.23ad.1 . . 3 |- (ph -> A.xph)
2 19.23ad.3 . . 3 |- (ph -> (ps -> ch))
31, 219.21ai 998 . 2 |- (ph -> A.x(ps -> ch))
4 19.23ad.2 . . 3 |- (ch -> A.xch)
5419.23 1063 . 2 |- (A.x(ps -> ch) <-> (E.xps -> ch))
63, 5sylib 198 1 |- (ph -> (E.xps -> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 954  E.wex 980
This theorem is referenced by:  19.23adv 1214  equs5 1221  a12study 1378  a12studyALT 1379  r19.23ad 1745  csbie2t 2033  mosubopt 2804  dffun7 3540  fopab2 3823  cbvfo 3885  tz7.48-1 3956  qusp 10555
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-4 973  ax-5o 975  ax-6o 978
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981
Copyright terms: Public domain