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

Theorem mprg 1249
Description: Modus ponens combined with restricted generalization.
Hypotheses
Ref Expression
mprg.1 |- (A.x e. A ph -> ps)
mprg.2 |- (x e. A -> ph)
Assertion
Ref Expression
mprg |- ps

Proof of Theorem mprg
StepHypRef Expression
1 mprg.2 . . 3 |- (x e. A -> ph)
21rgen 1247 . 2 |- A.x e. A ph
3 mprg.1 . 2 |- (A.x e. A ph -> ps)
42, 3ax-mp 6 1 |- ps
Colors of variables: wff set class
Syntax hints:   -> wi 2   e. wcel 1092  A.wral 1201
This theorem is referenced by:  r19.22i 1273  reuxfr2 1579  iuneq2i 2008  iineq2i 2009  rankuni 3533  ranklon 3540  projlem17 5209  goeq 5706
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-gen 677
This theorem depends on definitions:  df-bi 128  df-ral 1205
metamath.org