Theorem opelopab4 43993

Description: Ordered pair membership in a class abstraction of ordered pairs. Compare to elopab 5531. (Contributed by Alan Sare, 8-Feb-2014.) (Revised by Mario Carneiro, 6-May-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
opelopab4	⊢ (⟨𝑢, 𝑣⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑))

Distinct variable groups:   𝑥,𝑢   𝑦,𝑢   𝑥,𝑣   𝑦,𝑣

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑣,𝑢)

Proof of Theorem opelopab4

Step	Hyp	Ref	Expression
1		elopab 5531	. 2 ⊢ (⟨𝑢, 𝑣⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2		vex 3475	. . . . . 6 ⊢ 𝑥 ∈ V
3		vex 3475	. . . . . 6 ⊢ 𝑦 ∈ V
4	2, 3	opth 5480	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝑢, 𝑣⟩ ↔ (𝑥 = 𝑢 ∧ 𝑦 = 𝑣))
5		eqcom 2734	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝑢, 𝑣⟩ ↔ ⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩)
6	4, 5	bitr3i 276	. . . 4 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ↔ ⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩)
7	6	anbi1i 622	. . 3 ⊢ (((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑) ↔ (⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
8	7	2exbii 1843	. 2 ⊢ (∃𝑥∃𝑦((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑) ↔ ∃𝑥∃𝑦(⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
9	1, 8	bitr4i 277	1 ⊢ (⟨𝑢, 𝑣⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑))

Syntax hints:   ↔ wb 205   ∧ wa 394   = wceq 1533  ∃wex 1773   ∈ wcel 2098  ⟨cop 4636  {copab 5212

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2698  ax-sep 5301  ax-nul 5308  ax-pr 5431

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2705  df-cleq 2719  df-clel 2805  df-rab 3429  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-opab 5213

This theorem is referenced by: (None)