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

Axiom ax-7 676
Description: Axiom of Quantifier Commutation. This axiom says universal quantifiers can be swapped. One of the 4 axioms of pure predicate calculus. Axiom scheme C6' in [Megill] p. 448 (p. 16 of the preprint). Also appears as Lemma 12 of [Monk2] p. 109.
Assertion
Ref Expression
ax-7 |- (A.xA.yph -> A.yA.xph)

Detailed syntax breakdown of Axiom ax-7
StepHypRef Expression
1 wph . . . 4 wff ph
2 vy . . . 4 set y
31, 2wal 672 . . 3 wff A.yph
4 vx . . 3 set x
53, 4wal 672 . 2 wff A.xA.yph
61, 4wal 672 . . 3 wff A.xph
76, 2wal 672 . 2 wff A.yA.xph
85, 7wi 2 1 wff (A.xA.yph -> A.yA.xph)
Colors of variables: wff set class
This axiom is referenced by:  a7s 689  hbal 700  alcom 715  hbald 790  eq5 824  cbv1 845  sbal1 996
metamath.org