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

Theorem r19.32v 1750
Description: Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers.
Assertion
Ref Expression
r19.32v |- (A.x e. A (ph \/ ps) <-> (ph \/ A.x e. A ps))
Distinct variable group:   ph,x

Proof of Theorem r19.32v
StepHypRef Expression
1 r19.21v 1708 . 2 |- (A.x e. A (-. ph -> ps) <-> (-. ph -> A.x e. A ps))
2 df-or 224 . . 3 |- ((ph \/ ps) <-> (-. ph -> ps))
32ralbii 1659 . 2 |- (A.x e. A (ph \/ ps) <-> A.x e. A (-. ph -> ps))
4 df-or 224 . 2 |- ((ph \/ A.x e. A ps) <-> (-. ph -> A.x e. A ps))
51, 3, 43bitr4 183 1 |- (A.x e. A (ph \/ ps) <-> (ph \/ A.x e. A ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   \/ wo 222  A.wral 1637
This theorem is referenced by:  iinun2 2599  iinuni 2605
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ral 1641
Copyright terms: Public domain