| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Quantifier
Introduction. One of the 5 equality axioms of
predicate calculus. Informally, it says that whenever |
| Ref | Expression |
|---|---|
| ax-12 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vz |
. . . . 5
| |
| 2 | vx |
. . . . 5
| |
| 3 | 1, 2 | weq 797 |
. . . 4
|
| 4 | 3, 1 | wal 672 |
. . 3
|
| 5 | 4 | wn 1 |
. 2
|
| 6 | vy |
. . . . . 6
| |
| 7 | 1, 6 | weq 797 |
. . . . 5
|
| 8 | 7, 1 | wal 672 |
. . . 4
|
| 9 | 8 | wn 1 |
. . 3
|
| 10 | 2, 6 | weq 797 |
. . . 4
|
| 11 | 10, 1 | wal 672 |
. . . 4
|
| 12 | 10, 11 | wi 2 |
. . 3
|
| 13 | 9, 12 | wi 2 |
. 2
|
| 14 | 5, 13 | wi 2 |
1
|
| Colors of variables: wff set class |
| This axiom is referenced by: eqid 810 eq5 824 eqvin.l1 851 hbsb4 905 ddelimf2 907 sbcom 916 ax17eq 923 sbal1 996 axrepndlem2 3739 axacndlem4 3756 axacnd 3758 |