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

Theorem stdpc6 1125
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).
Assertion
Ref Expression
stdpc6 |- A.x x = x

Proof of Theorem stdpc6
StepHypRef Expression
1 equid 1124 . 2 |- x = x
21ax-gen 961 1 |- A.x x = x
Colors of variables: wff set class
Syntax hints:  A.wal 952   = wceq 954
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
Copyright terms: Public domain