Theorem opelopab4 45628

Description: Ordered pair membership in a class abstraction of ordered pairs. Compare to elopab 5500. (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 5500	. 2 ⊢ (⟨𝑢, 𝑣⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2		vex 3454	. . . . . 6 ⊢ 𝑥 ∈ V
3		vex 3454	. . . . . 6 ⊢ 𝑦 ∈ V
4	2, 3	opth 5444	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝑢, 𝑣⟩ ↔ (𝑥 = 𝑢 ∧ 𝑦 = 𝑣))
5		eqcom 2767	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝑢, 𝑣⟩ ↔ ⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩)
6	4, 5	bitr3i 280	. . . 4 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ↔ ⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩)
7	6	anbi1i 636	. . 3 ⊢ (((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑) ↔ (⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
8	7	2exbii 1881	. 2 ⊢ (∃𝑥∃𝑦((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑) ↔ ∃𝑥∃𝑦(⟨𝑢, 𝑣⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
9	1, 8	bitr4i 281	1 ⊢ (⟨𝑢, 𝑣⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) ∧ 𝜑))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ⟨cop 4834  {copab 5166

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167

This theorem is used by: (None)