Theorem dfid2 5557

Description: Alternate definition of the identity relation. Instance of dfid3 5558 not requiring auxiliary axioms. (Contributed by NM, 15-Mar-2007.) Reduce axiom usage. (Revised by GG, 4-Nov-2024.) (Proof shortened by BJ, 5-Nov-2024.)

Use df-id 5555 instead to make the semantics of the constructor df-opab 5173 clearer. (New usage is discouraged.)

Assertion

Ref	Expression
dfid2	⊢ I = {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥}

Proof of Theorem dfid2

Dummy variables 𝑦 𝑧 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-id 5555	. 2 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
2		equcomi 2046	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → 𝑦 = 𝑥)
3	2	opeq2d 4844	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑥⟩)
4	3	eqeq2d 2773	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝑧 = ⟨𝑥, 𝑥⟩))
5	4	pm5.32ri 585	. . . . . . . . 9 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦))
6	5	exbii 1877	. . . . . . . 8 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦))
7		ax6evr 2044	. . . . . . . . 9 ⊢ ∃𝑦 𝑥 = 𝑦
8		19.42v 1982	. . . . . . . . 9 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦 𝑥 = 𝑦))
9	7, 8	mpbiran2 722	. . . . . . . 8 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦) ↔ 𝑧 = ⟨𝑥, 𝑥⟩)
10	6, 9	bitri 278	. . . . . . 7 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ 𝑧 = ⟨𝑥, 𝑥⟩)
11		eqidd 2763	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑥⟩ → 𝑥 = 𝑥)
12	11	pm4.71i 568	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑥⟩ ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
13	10, 12	bitri 278	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
14	13	exbii 1877	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
15		id 23	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → 𝑥 = 𝑢)
16	15, 15	opeq12d 4845	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → ⟨𝑥, 𝑥⟩ = ⟨𝑢, 𝑢⟩)
17	16	eqeq2d 2773	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (𝑧 = ⟨𝑥, 𝑥⟩ ↔ 𝑧 = ⟨𝑢, 𝑢⟩))
18	15, 15	eqeq12d 2778	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (𝑥 = 𝑥 ↔ 𝑢 = 𝑢))
19	17, 18	anbi12d 643	. . . . . 6 ⊢ (𝑥 = 𝑢 → ((𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ (𝑧 = ⟨𝑢, 𝑢⟩ ∧ 𝑢 = 𝑢)))
20	19	exexw 2082	. . . . 5 ⊢ (∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
21	14, 20	bitri 278	. . . 4 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
22	21	abbii 2829	. . 3 ⊢ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)} = {𝑧 ∣ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥)}
23		df-opab 5173	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)}
24		df-opab 5173	. . 3 ⊢ {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥} = {𝑧 ∣ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥)}
25	22, 23, 24	3eqtr4i 2795	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥}
26	1, 25	eqtri 2785	1 ⊢ I = {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥}

This proof depends on syntax axioms:   ∧ wa 400   = wceq 1569  ∃wex 1808  {cab 2740  ⟨cop 4594  {copab 5172   I cid 5554

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-id 5555

This theorem is used by: (None)