Theorem stdpc6 1717

Description: One of the two equality axioms of standard predicate calculus, called reflexivity of equality. (The other one is stdpc7 1784.) 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). (Contributed by NM, 16-Feb-2005.)

Assertion

Ref	Expression
stdpc6	⊢ ∀𝑥 𝑥 = 𝑥

Proof of Theorem stdpc6

Step	Hyp	Ref	Expression
1		equid 1715	. 2 ⊢ 𝑥 = 𝑥
2	1	ax-gen 1463	1 ⊢ ∀𝑥 𝑥 = 𝑥

Syntax hints:  ∀wal 1362

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-gen 1463  ax-ie2 1508  ax-8 1518  ax-17 1540  ax-i9 1544

This theorem depends on definitions:  df-bi 117

This theorem is referenced by: (None)