| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: One of the two equality axioms of standard predicate calculus, called reflexivity of equality. (The other one is stdpc7 1178.) Axiom 6 of [Mendelson] p. 95. Mendelson doesn't say why he prepended the redundant quantifier, but it was probably to be compatible with free logic (which is valid in the empty domain). |
| Ref | Expression |
|---|---|
| stdpc6 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equid 1124 |
. 2
| |
| 2 | 1 | ax-gen 961 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 961 ax-12 966 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 |