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

Theorem r19.21v 1260
Description: Theorem 19.21 of [Margaris] p. 90 with restricted quantifiers.
Assertion
Ref Expression
r19.21v |- (A.x e. A (ph -> ps) <-> (ph -> A.x e. A ps))
Distinct variable group(s):   ph,x

Proof of Theorem r19.21v
StepHypRef Expression
1 bi2.04 141 . . . 4 |- ((x e. A -> (ph -> ps)) <-> (ph -> (x e. A -> ps)))
21bial 695 . . 3 |- (A.x(x e. A -> (ph -> ps)) <-> A.x(ph -> (x e. A -> ps)))
3 19.21v 942 . . 3 |- (A.x(ph -> (x e. A -> ps)) <-> (ph -> A.x(x e. A -> ps)))
42, 3bitr 151 . 2 |- (A.x(x e. A -> (ph -> ps)) <-> (ph -> A.x(x e. A -> ps)))
5 df-ral 1205 . 2 |- (A.x e. A (ph -> ps) <-> A.x(x e. A -> (ph -> ps)))
6 df-ral 1205 . . 3 |- (A.x e. A ps <-> A.x(x e. A -> ps))
76imbi2i 160 . 2 |- ((ph -> A.x e. A ps) <-> (ph -> A.x(x e. A -> ps)))
84, 5, 73bitr4 158 1 |- (A.x e. A (ph -> ps) <-> (ph -> A.x e. A ps))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  A.wal 672   e. wcel 1092  A.wral 1201
This theorem is referenced by:  r19.32v 1297  ssiin 2024  dftr5 2044  tfinds2 2405  tfinds3 2406  tfr3 2964
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-17 925
This theorem depends on definitions:  df-bi 128  df-an 198  df-ral 1205
metamath.org