| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: One of the two equality axioms of standard predicate calculus, called reflexivity of equality. (The other one is stdpc7 1179.) 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 | ⊢ ∀x x = x |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equid 1125 | . 2 ⊢ x = x | |
| 2 | 1 | ax-gen 962 | 1 ⊢ ∀x x = x |
| Colors of variables: wff set class |
| Syntax hints: ∀wal 953 = wceq 955 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 962 ax-12 967 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 |