Theorem stdpc6 1164

Description: One of the two equality axioms of standard predicate calculus, called reflexivity of equality. (The other one is stdpc7 1217.) 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

Step	Hyp	Ref	Expression
1		equid 1162	. 2 |- x = x
2	1	ax-gen 999	1 |- A.x x = x

Syntax hints:  A.wal 990   = wceq 992

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 999  ax-12 1004  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159

Copyright terms: Public domain