Theorem opabid2 5838

Description: A relation expressed as an ordered pair abstraction. (Contributed by NM, 11-Dec-2006.)

Assertion

Ref	Expression
opabid2	⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem opabid2

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3476	. . . 4 ⊢ 𝑧 ∈ V
2		vex 3476	. . . 4 ⊢ 𝑤 ∈ V
3		opeq1 4884	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
4	3	eleq1d 2814	. . . 4 ⊢ (𝑥 = 𝑧 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑦⟩ ∈ 𝐴))
5		opeq2 4885	. . . . 5 ⊢ (𝑦 = 𝑤 → ⟨𝑧, 𝑦⟩ = ⟨𝑧, 𝑤⟩)
6	5	eleq1d 2814	. . . 4 ⊢ (𝑦 = 𝑤 → (⟨𝑧, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴))
7	1, 2, 4, 6	opelopab 5552	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
8	7	gen2 1791	. 2 ⊢ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
9		relopabv 5831	. . 3 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴}
10		eqrel 5794	. . 3 ⊢ ((Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ∧ Rel 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
11	9, 10	mpan 688	. 2 ⊢ (Rel 𝐴 → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
12	8, 11	mpbiri 257	1 ⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1532   = wceq 1534   ∈ wcel 2100  ⟨cop 4642  {copab 5218  Rel wrel 5691

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 2102  ax-9 2110  ax-ext 2700  ax-sep 5307  ax-nul 5314  ax-pr 5437

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2062  df-clab 2707  df-cleq 2721  df-clel 2806  df-rab 3429  df-v 3474  df-dif 3962  df-un 3964  df-ss 3976  df-nul 4336  df-if 4537  df-sn 4637  df-pr 4639  df-op 4643  df-opab 5219  df-xp 5692  df-rel 5693

This theorem is referenced by:  opabbi2dv  5860  tfsconcat0i  43082