Theorem opelopabd 38105

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 5500	. 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 38103	. 2 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))
10	1, 9	bitrid 286	1 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811  Ⅎwnf 1815   ∈ wcel 2144  ⟨cop 4589  {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-10 2177  ax-11 2193  ax-12 2212  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-nf 1816  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 4584  df-pr 4586  df-op 4590  df-opab 5167

This theorem is used by:  brabd0  38111