Theorem dfid2 5572

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

Use df-id 5570 instead to make the semantics of the constructor df-opab 5205 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 5570	. 2 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
2		equcomi 2013	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → 𝑦 = 𝑥)
3	2	opeq2d 4876	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑥⟩)
4	3	eqeq2d 2738	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝑧 = ⟨𝑥, 𝑥⟩))
5	4	pm5.32ri 575	. . . . . . . . 9 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦))
6	5	exbii 1843	. . . . . . . 8 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦))
7		ax6evr 2011	. . . . . . . . 9 ⊢ ∃𝑦 𝑥 = 𝑦
8		19.42v 1950	. . . . . . . . 9 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦 𝑥 = 𝑦))
9	7, 8	mpbiran2 709	. . . . . . . 8 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑦) ↔ 𝑧 = ⟨𝑥, 𝑥⟩)
10	6, 9	bitri 275	. . . . . . 7 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ 𝑧 = ⟨𝑥, 𝑥⟩)
11		eqidd 2728	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑥⟩ → 𝑥 = 𝑥)
12	11	pm4.71i 559	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑥⟩ ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
13	10, 12	bitri 275	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ (𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
14	13	exbii 1843	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
15		id 22	. . . . . . . . 9 ⊢ (𝑥 = 𝑢 → 𝑥 = 𝑢)
16	15, 15	opeq12d 4877	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → ⟨𝑥, 𝑥⟩ = ⟨𝑢, 𝑢⟩)
17	16	eqeq2d 2738	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (𝑧 = ⟨𝑥, 𝑥⟩ ↔ 𝑧 = ⟨𝑢, 𝑢⟩))
18	15, 15	eqeq12d 2743	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (𝑥 = 𝑥 ↔ 𝑢 = 𝑢))
19	17, 18	anbi12d 630	. . . . . 6 ⊢ (𝑥 = 𝑢 → ((𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ (𝑧 = ⟨𝑢, 𝑢⟩ ∧ 𝑢 = 𝑢)))
20	19	exexw 2047	. . . . 5 ⊢ (∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
21	14, 20	bitri 275	. . . 4 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦) ↔ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
22	21	abbii 2797	. . 3 ⊢ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)} = {𝑧 ∣ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥)}
23		df-opab 5205	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)}
24		df-opab 5205	. . 3 ⊢ {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥} = {𝑧 ∣ ∃𝑥∃𝑥(𝑧 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥)}
25	22, 23, 24	3eqtr4i 2765	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥}
26	1, 25	eqtri 2755	1 ⊢ I = {⟨𝑥, 𝑥⟩ ∣ 𝑥 = 𝑥}

Syntax hints:   ∧ wa 395   = wceq 1534  ∃wex 1774  {cab 2704  ⟨cop 4630  {copab 5204   I cid 5569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-opab 5205  df-id 5570

This theorem is referenced by: (None)