Theorem equid1 39733

Description: Proof of equid 2045 from our older axioms. This is often an axiom of equality in textbook systems, but we don't need it as an axiom since it can be proved from our other axioms (although the proof, as you can see below, is not as obvious as you might think). This proof uses only axioms without distinct variable conditions and requires no dummy variables. A simpler proof, similar to Tarski's, is possible if we make use of ax-5 1943; see the proof of equid 2045. See equid1ALT 39759 for an alternate proof. (Contributed by NM, 10-Jan-1993.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
equid1	⊢ 𝑥 = 𝑥

Proof of Theorem equid1

Step	Hyp	Ref	Expression
1		ax-c4 39718	. . . 4 ⊢ (∀𝑥(∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → (𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥)) → (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → ∀𝑥(𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥)))
2		ax-c5 39717	. . . . 5 ⊢ (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → ¬ ∀𝑥 𝑥 = 𝑥)
3		ax-c9 39724	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑥 → (¬ ∀𝑥 𝑥 = 𝑥 → (𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥)))
4	2, 2, 3	sylc 66	. . . 4 ⊢ (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → (𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥))
5	1, 4	mpg 1830	. . 3 ⊢ (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → ∀𝑥(𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥))
6		ax-c10 39720	. . 3 ⊢ (∀𝑥(𝑥 = 𝑥 → ∀𝑥 𝑥 = 𝑥) → 𝑥 = 𝑥)
7	5, 6	syl 18	. 2 ⊢ (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → 𝑥 = 𝑥)
8		ax-c7 39719	. 2 ⊢ (¬ ∀𝑥 ¬ ∀𝑥 𝑥 = 𝑥 → 𝑥 = 𝑥)
9	7, 8	pm2.61i 184	1 ⊢ 𝑥 = 𝑥

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-c5 39717  ax-c4 39718  ax-c7 39719  ax-c10 39720  ax-c9 39724

This theorem is used by:  equcomi1  39734