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

Theorem r19.15 1753
Description: Distribute a restricted universal quantifier over a biconditional. Theorem 19.15 of [Margaris] p. 90 with restricted quantification.
Assertion
Ref Expression
r19.15 |- (A.x e. A (ph <-> ps) -> (A.x e. A ph <-> A.x e. A ps))

Proof of Theorem r19.15
StepHypRef Expression
1 hbra1 1687 . 2 |- (A.x e. A (ph <-> ps) -> A.xA.x e. A (ph <-> ps))
2 ra4 1694 . . 3 |- (A.x e. A (ph <-> ps) -> (x e. A -> (ph <-> ps)))
32imp 350 . 2 |- ((A.x e. A (ph <-> ps) /\ x e. A) -> (ph <-> ps))
41, 3ralbida 1657 1 |- (A.x e. A (ph <-> ps) -> (A.x e. A ph <-> A.x e. A ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   e. wcel 958  A.wral 1645
This theorem is referenced by:  rankonid 4695  kmlem8 4772  kmlem13 4777  expcnv 7233
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
This theorem depends on definitions:  df-bi 147  df-an 225  df-ral 1649
Copyright terms: Public domain