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

Theorem r19.21t 1715
Description: Theorem 19.21 of [Margaris] p. 90 with restricted quantifiers (closed theorem version).
Assertion
Ref Expression
r19.21t |- (A.x(ph -> A.xph) -> (A.x e. A (ph -> ps) <-> (ph -> A.x e. A ps)))

Proof of Theorem r19.21t
StepHypRef Expression
1 19.21t 1115 . . 3 |- (A.x(ph -> A.xph) -> (A.x(ph -> (x e. A -> ps)) <-> (ph -> A.x(x e. A -> ps))))
2 bi2.04 160 . . . 4 |- ((x e. A -> (ph -> ps)) <-> (ph -> (x e. A -> ps)))
32albii 999 . . 3 |- (A.x(x e. A -> (ph -> ps)) <-> A.x(ph -> (x e. A -> ps)))
41, 3syl5bb 532 . 2 |- (A.x(ph -> A.xph) -> (A.x(x e. A -> (ph -> ps)) <-> (ph -> A.x(x e. A -> ps))))
5 df-ral 1649 . 2 |- (A.x e. A (ph -> ps) <-> A.x(x e. A -> (ph -> ps)))
6 df-ral 1649 . . 3 |- (A.x e. A ps <-> A.x(x e. A -> ps))
76imbi2i 185 . 2 |- ((ph -> A.x e. A ps) <-> (ph -> A.x(x e. A -> ps)))
84, 5, 73bitr4g 555 1 |- (A.x(ph -> A.xph) -> (A.x e. A (ph -> ps) <-> (ph -> A.x e. A ps)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954   e. wcel 958  A.wral 1645
This theorem is referenced by:  r19.21v 1716  sbcralt 1990  sbcralgf 1992
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-ral 1649
Copyright terms: Public domain