Theorem equid1 1264

Description: Identity law for equality (reflexivity). Lemma 6 of [Tarski] p. 68. This proof is similar to Tarski's and makes use of a dummy variable y. See equid 1122 for a proof that avoids dummy variables (but is less intuitive).

Assertion

Ref	Expression
equid1	|- x = x

Proof of Theorem equid1

Step	Hyp	Ref	Expression
1		a9e 1121	. 2 |- E.y y = x
2		ax-17 968	. . 3 |- (x = x -> A.y x = x)
3		ax-8 961	. . . 4 |- (y = x -> (y = x -> x = x))
4	3	pm2.43i 64	. . 3 |- (y = x -> x = x)
5	2, 4	19.23ai 1060	. 2 |- (E.y y = x -> x = x)
6	1, 5	ax-mp 7	1 |- x = x

Syntax hints:   = wceq 953  E.wex 977

This theorem is referenced by:  ax16i 1265  a12study 1371

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-8 961  ax-9 962  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978

Copyright terms: Public domain