| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| 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. |
| Ref | Expression |
|---|---|
| ax-7 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wph |
. . . 4
| |
| 2 | vy |
. . . 4
| |
| 3 | 1, 2 | wal 672 |
. . 3
|
| 4 | vx |
. . 3
| |
| 5 | 3, 4 | wal 672 |
. 2
|
| 6 | 1, 4 | wal 672 |
. . 3
|
| 7 | 6, 2 | wal 672 |
. 2
|
| 8 | 5, 7 | wi 2 |
1
|
| 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 |