Theorem brabd 37112

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
brabd.exa	⊢ (𝜑 → 𝐴 ∈ 𝑈)
brabd.exb	⊢ (𝜑 → 𝐵 ∈ 𝑉)
brabd.def	⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
brabd.is	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

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

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

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

Proof of Theorem brabd

Step	Hyp	Ref	Expression
1		ax-5 1910	. 2 ⊢ (𝜑 → ∀𝑥𝜑)
2		ax-5 1910	. 2 ⊢ (𝜑 → ∀𝑦𝜑)
3		nfvd 1915	. 2 ⊢ (𝜑 → Ⅎ𝑥𝜒)
4		nfvd 1915	. 2 ⊢ (𝜑 → Ⅎ𝑦𝜒)
5		brabd.exa	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
6		brabd.exb	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7		brabd.def	. 2 ⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
8		brabd.is	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
9	1, 2, 3, 4, 5, 6, 7, 8	brabd0 37111	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108   class class class wbr 5119  {copab 5181

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-br 5120  df-opab 5182

This theorem is referenced by:  bj-imdirval3  37148