Theorem opabid2 5829

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 3479	. . . 4 ⊢ 𝑧 ∈ V
2		vex 3479	. . . 4 ⊢ 𝑤 ∈ V
3		opeq1 4874	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
4	3	eleq1d 2819	. . . 4 ⊢ (𝑥 = 𝑧 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑦⟩ ∈ 𝐴))
5		opeq2 4875	. . . . 5 ⊢ (𝑦 = 𝑤 → ⟨𝑧, 𝑦⟩ = ⟨𝑧, 𝑤⟩)
6	5	eleq1d 2819	. . . 4 ⊢ (𝑦 = 𝑤 → (⟨𝑧, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴))
7	1, 2, 4, 6	opelopab 5543	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
8	7	gen2 1799	. 2 ⊢ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
9		relopabv 5822	. . 3 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴}
10		eqrel 5785	. . 3 ⊢ ((Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ∧ Rel 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
11	9, 10	mpan 689	. 2 ⊢ (Rel 𝐴 → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
12	8, 11	mpbiri 258	1 ⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1540   = wceq 1542   ∈ wcel 2107  ⟨cop 4635  {copab 5211  Rel wrel 5682

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-opab 5212  df-xp 5683  df-rel 5684

This theorem is referenced by:  opabbi2dv  5850  tfsconcat0i  42095