Theorem brab2d 5522

Description: Expressing that two sets are related by a binary relation which is expressed as a class abstraction of ordered pairs. (Contributed by Thierry Arnoux, 4-May-2025.)

Hypotheses

Ref	Expression
brab2d.1	⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)})
brab2d.2	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
brab2d	⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))

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

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

Proof of Theorem brab2d

Step	Hyp	Ref	Expression
1		df-br 5110	. . . 4 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
2		brab2d.1	. . . . 5 ⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)})
3	2	eleq2d 2849	. . . 4 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)}))
4	1, 3	bitrid 286	. . 3 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)}))
5		elopab 5511	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)} ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)))
6	4, 5	bitrdi 290	. 2 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))))
7		eqcom 2770	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩)
8		vex 3459	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
9		vex 3459	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
10	8, 9	opth 5458	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
11	7, 10	sylbb1 240	. . . . . . . . 9 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
12		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈))
13		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑉 ↔ 𝐵 ∈ 𝑉))
14	12, 13	bi2anan9 649	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
15	14	biimpa 481	. . . . . . . . 9 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
16	11, 15	sylan 591	. . . . . . . 8 ⊢ ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
17	16	adantl 486	. . . . . . 7 ⊢ ((𝜑 ∧ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
18	17	adantrrr 737	. . . . . 6 ⊢ ((𝜑 ∧ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
19	18	ex 417	. . . . 5 ⊢ (𝜑 → ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
20	19	exlimdvv 1964	. . . 4 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
21	20	imp 411	. . 3 ⊢ ((𝜑 ∧ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
22		simprl 782	. . 3 ⊢ ((𝜑 ∧ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
23		simprl 782	. . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → 𝐴 ∈ 𝑈)
24		simprr 784	. . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
25	14	adantl 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
26		brab2d.2	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
27	25, 26	anbi12d 643	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
28	27	adantlr 727	. . . 4 ⊢ (((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
29	23, 24, 28	copsex2dv 5477	. . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
30	21, 22, 29	bibiad 852	. 2 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
31	6, 30	bitrd 282	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ⟨cop 4595   class class class wbr 5109  {copab 5173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174

This theorem is referenced by:  brprlng  29188  erlcl1  33580  erlcl2  33581  erldi  33582  erlbrd  33583  erler  33585  fracerl  33627