Theorem brabd0 37646

Description: Expressing that two sets are related by a binary relation which is expressed as a class abstraction of ordered pairs. (Contributed by BJ, 17-Dec-2023.)

Hypotheses

Ref	Expression
brabd0.x	⊢ (𝜑 → ∀𝑥𝜑)
brabd0.y	⊢ (𝜑 → ∀𝑦𝜑)
brabd0.xch	⊢ (𝜑 → Ⅎ𝑥𝜒)
brabd0.ych	⊢ (𝜑 → Ⅎ𝑦𝜒)
brabd0.exa	⊢ (𝜑 → 𝐴 ∈ 𝑈)
brabd0.exb	⊢ (𝜑 → 𝐵 ∈ 𝑉)
brabd0.def	⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
brabd0.is	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
brabd0	⊢ (𝜑 → (𝐴𝑅𝐵 ↔ 𝜒))

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

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

Proof of Theorem brabd0

Step	Hyp	Ref	Expression
1		df-br 5105	. . 3 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
2		brabd0.def	. . . 4 ⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
3	2	eleq2d 2851	. . 3 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓}))
4	1, 3	bitrid 286	. 2 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓}))
5		brabd0.x	. . 3 ⊢ (𝜑 → ∀𝑥𝜑)
6		brabd0.y	. . 3 ⊢ (𝜑 → ∀𝑦𝜑)
7		brabd0.xch	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝜒)
8		brabd0.ych	. . 3 ⊢ (𝜑 → Ⅎ𝑦𝜒)
9		brabd0.exa	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
10		brabd0.exb	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
11		brabd0.is	. . 3 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
12	5, 6, 7, 8, 9, 10, 11	opelopabd 37640	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜓} ↔ 𝜒))
13	4, 12	bitrd 282	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1561   = wceq 1563  Ⅎwnf 1806   ∈ wcel 2145  ⟨cop 4591   class class class wbr 5104  {copab 5166

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5105  df-opab 5167

This theorem is referenced by:  brabd  37647