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

Theorem a7s 689
Description: Swap quantifiers in an antecedent.
Hypothesis
Ref Expression
a7s.1 |- (A.xA.yph -> ps)
Assertion
Ref Expression
a7s |- (A.yA.xph -> ps)

Proof of Theorem a7s
StepHypRef Expression
1 ax-7 676 . 2 |- (A.yA.xph -> A.xA.yph)
2 a7s.1 . 2 |- (A.xA.yph -> ps)
31, 2syl 12 1 |- (A.yA.xph -> ps)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672
This theorem is referenced by:  cbv1 845  cbv2 846  hbsb4 905  hbsb4t 906  sb9i 920  mo 1020
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6  ax-7 676
metamath.org