Theorem opelopabd 37880

Description: Membership of an ordered pair in a class abstraction of ordered pairs. (Contributed by BJ, 17-Dec-2023.)

Hypotheses

Ref	Expression
opelopabd.xph	⊢ (𝜑 → ∀𝑥𝜑)
opelopabd.yph	⊢ (𝜑 → ∀𝑦𝜑)
opelopabd.xch	⊢ (𝜑 → Ⅎ𝑥𝜒)
opelopabd.ych	⊢ (𝜑 → Ⅎ𝑦𝜒)
opelopabd.exa	⊢ (𝜑 → 𝐴 ∈ 𝑈)
opelopabd.exb	⊢ (𝜑 → 𝐵 ∈ 𝑉)
opelopabd.is	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
opelopabd	⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜒))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑦)   𝑈(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem opelopabd

Step	Hyp	Ref	Expression
1		elopab 5509	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
2		opelopabd.xph	. . 3 ⊢ (𝜑 → ∀𝑥𝜑)
3		opelopabd.yph	. . 3 ⊢ (𝜑 → ∀𝑦𝜑)
4		opelopabd.xch	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝜒)
5		opelopabd.ych	. . 3 ⊢ (𝜑 → Ⅎ𝑦𝜒)
6		opelopabd.exa	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
7		opelopabd.exb	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
8		opelopabd.is	. . 3 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
9	2, 3, 4, 5, 6, 7, 8	copsex2d 37878	. 2 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))
10	1, 9	bitrid 286	1 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2145  ⟨cop 4593  {copab 5171

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-opab 5172

This theorem is used by:  brabd0  37886