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

Theorem a7s 1032
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 1003 . 2 |- (A.yA.xph -> A.xA.yph)
2 a7s.1 . 2 |- (A.xA.yph -> ps)
31, 2syl 10 1 |- (A.yA.xph -> ps)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 995
This theorem is referenced by:  cbv1 1204  cbv2 1205  hbsb4 1290  hbsb4t 1291  sb9i 1305  mo 1435  hbfvd2 3788
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-mp 7  ax-7 1003
Copyright terms: Public domain