Theorem opabid2 5803

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 3460	. . . 4 ⊢ 𝑧 ∈ V
2		vex 3460	. . . 4 ⊢ 𝑤 ∈ V
3		opeq1 4833	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨𝑥, 𝑦⟩ = ⟨𝑧, 𝑦⟩)
4	3	eleq1d 2849	. . . 4 ⊢ (𝑥 = 𝑧 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑦⟩ ∈ 𝐴))
5		opeq2 4834	. . . . 5 ⊢ (𝑦 = 𝑤 → ⟨𝑧, 𝑦⟩ = ⟨𝑧, 𝑤⟩)
6	5	eleq1d 2849	. . . 4 ⊢ (𝑦 = 𝑤 → (⟨𝑧, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴))
7	1, 2, 4, 6	opelopab 5515	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
8	7	gen2 1818	. 2 ⊢ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)
9		relopabv 5796	. . 3 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴}
10		eqrel 5758	. . 3 ⊢ ((Rel {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ∧ Rel 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
11	9, 10	mpan 700	. 2 ⊢ (Rel 𝐴 → ({⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴 ↔ ∀𝑧∀𝑤(⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} ↔ ⟨𝑧, 𝑤⟩ ∈ 𝐴)))
12	8, 11	mpbiri 260	1 ⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)

Syntax hints:   → wi 4   ↔ wb 208  ∀wal 1560   = wceq 1562   ∈ wcel 2144  ⟨cop 4590  {copab 5164  Rel wrel 5654

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5165  df-xp 5655  df-rel 5656

This theorem is referenced by:  opabbi2dv  5823  tfsconcat0i  43927