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

Theorem aaan 1115
Description: Rearrange universal quantifiers.
Hypotheses
Ref Expression
aaan.1 |- (ph -> A.yph)
aaan.2 |- (ps -> A.xps)
Assertion
Ref Expression
aaan |- (A.xA.y(ph /\ ps) <-> (A.xph /\ A.yps))

Proof of Theorem aaan
StepHypRef Expression
1 aaan.1 . . . 4 |- (ph -> A.yph)
2119.28 1066 . . 3 |- (A.y(ph /\ ps) <-> (ph /\ A.yps))
32albii 996 . 2 |- (A.xA.y(ph /\ ps) <-> A.x(ph /\ A.yps))
4 aaan.2 . . . 4 |- (ps -> A.xps)
54hbal 1002 . . 3 |- (A.yps -> A.xA.yps)
6519.27 1065 . 2 |- (A.x(ph /\ A.yps) <-> (A.xph /\ A.yps))
73, 6bitr 173 1 |- (A.xA.y(ph /\ ps) <-> (A.xph /\ A.yps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 951
This theorem is referenced by:  mo 1386  2mo 1440  2eu4 1445
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-4 970  ax-5o 972
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain