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

Theorem r19.26-2 1290
Description: Theorem 19.26 of [Margaris] p. 90 with 2 restricted quantifiers.
Assertion
Ref Expression
r19.26-2 |- (A.x e. A A.y e. B (ph /\ ps) <-> (A.x e. A A.y e. B ph /\ A.x e. A A.y e. B ps))

Proof of Theorem r19.26-2
StepHypRef Expression
1 r19.26 1289 . . 3 |- (A.y e. B (ph /\ ps) <-> (A.y e. B ph /\ A.y e. B ps))
21biral 1223 . 2 |- (A.x e. A A.y e. B (ph /\ ps) <-> A.x e. A (A.y e. B ph /\ A.y e. B ps))
3 r19.26 1289 . 2 |- (A.x e. A (A.y e. B ph /\ A.y e. B ps) <-> (A.x e. A A.y e. B ph /\ A.x e. A A.y e. B ps))
42, 3bitr 151 1 |- (A.x e. A A.y e. B (ph /\ ps) <-> (A.x e. A A.y e. B ph /\ A.x e. A A.y e. B ps))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   /\ wa 196  A.wral 1201
This theorem is referenced by:  fununi 2705
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-gen 677
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ral 1205
metamath.org