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

Theorem alral 1684
Description: Universal quantification implies restricted quantification.
Assertion
Ref Expression
alral |- (A.xph -> A.x e. A ph)

Proof of Theorem alral
StepHypRef Expression
1 ax-1 4 . . 3 |- (ph -> (x e. A -> ph))
2119.20i 989 . 2 |- (A.xph -> A.x(x e. A -> ph))
3 df-ral 1641 . 2 |- (A.x e. A ph <-> A.x(x e. A -> ph))
42, 3sylibr 200 1 |- (A.xph -> A.x e. A ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 951   e. wcel 955  A.wral 1637
This theorem is referenced by:  brdom5 4774  brdom4 4775
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
This theorem depends on definitions:  df-bi 147  df-ral 1641
Copyright terms: Public domain