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

Theorem r19.21ad 1709
Description: Inference from Theorem 19.21 of [Margaris] p. 90. (Restricted quantifier version.)
Hypotheses
Ref Expression
r19.21ad.1 |- (ph -> A.xph)
r19.21ad.2 |- (ps -> A.xps)
r19.21ad.3 |- (ph -> (ps -> (x e. A -> ch)))
Assertion
Ref Expression
r19.21ad |- (ph -> (ps -> A.x e. A ch))

Proof of Theorem r19.21ad
StepHypRef Expression
1 r19.21ad.1 . . 3 |- (ph -> A.xph)
2 r19.21ad.2 . . 3 |- (ps -> A.xps)
3 r19.21ad.3 . . 3 |- (ph -> (ps -> (x e. A -> ch)))
41, 2, 319.21ad 1055 . 2 |- (ph -> (ps -> A.x(x e. A -> ch)))
5 df-ral 1641 . 2 |- (A.x e. A ch <-> A.x(x e. A -> ch))
64, 5syl6ibr 213 1 |- (ph -> (ps -> A.x e. A ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 951   e. wcel 955  A.wral 1637
This theorem is referenced by:  r19.21adv 1710  isotrALT 3883  tfrlem1 3896  mapxpen 4475  fzrevralt 6451  bccl2t 6909
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  ax-6o 975
This theorem depends on definitions:  df-bi 147  df-an 225  df-ral 1641
Copyright terms: Public domain