Theorem brab2d 5515

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 5106	. . . 4 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
2		brab2d.1	. . . . 5 ⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)})
3	2	eleq2d 2849	. . . 4 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)}))
4	1, 3	bitrid 286	. . 3 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)}))
5		elopab 5504	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)} ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)))
6	4, 5	bitrdi 290	. 2 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))))
7		eqcom 2770	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩)
8		vex 3457	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
9		vex 3457	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
10	8, 9	opth 5448	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
11	7, 10	sylbb1 240	. . . . . . . . 9 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
12		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈))
13		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑉 ↔ 𝐵 ∈ 𝑉))
14	12, 13	bi2anan9 650	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
15	14	biimpa 482	. . . . . . . . 9 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
16	11, 15	sylan 592	. . . . . . . 8 ⊢ ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
17	16	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
18	17	adantrrr 738	. . . . . 6 ⊢ ((𝜑 ∧ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
19	18	ex 418	. . . . 5 ⊢ (𝜑 → ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
20	19	exlimdvv 1968	. . . 4 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
21	20	imp 412	. . 3 ⊢ ((𝜑 ∧ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓))) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
22		simprl 783	. . 3 ⊢ ((𝜑 ∧ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)) → (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉))
23		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → 𝐴 ∈ 𝑈)
24		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
25	14	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
26		brab2d.2	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
27	25, 26	anbi12d 644	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
28	27	adantlr 728	. . . 4 ⊢ (((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
29	23, 24, 28	copsex2dv 5469	. . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
30	21, 22, 29	bibiad 853	. 2 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝑈 ∧ 𝑦 ∈ 𝑉) ∧ 𝜓)) ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))
31	6, 30	bitrd 282	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146  ⟨cop 4837   class class class wbr 5105  {copab 5169

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394

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 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170

This theorem is used by:  tgaaddcpbl2  29365  brprlng  29428  erlcl1  33874  erlcl2  33875  erldi  33876  erlbrd  33877  erler  33879  fracerl  33921  brlexod  35953  brr0d  35955