Theorem brab2ddw 49414

Description: Expressing that two sets are related by a binary relation which is expressed as a class abstraction of ordered pairs. (Contributed by Zhi Wang, 24-Sep-2025.)

Hypotheses

Ref	Expression
brab2dd.1	⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) ∧ 𝜓)})
brab2ddw.2	⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜃))
brab2ddw.3	⊢ (𝑦 = 𝐵 → (𝜃 ↔ 𝜒))
brab2ddw.4	⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝑈)
brab2ddw.5	⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐷 = 𝑉)

Assertion

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

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

Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜃(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦)   𝑅(𝑥,𝑦)

Proof of Theorem brab2ddw

Step	Hyp	Ref	Expression
1		brab2dd.1	. 2 ⊢ (𝜑 → 𝑅 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) ∧ 𝜓)})
2		brab2ddw.2	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜃))
3		brab2ddw.3	. . . 4 ⊢ (𝑦 = 𝐵 → (𝜃 ↔ 𝜒))
4	2, 3	sylan9bb 517	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))
5	4	adantl 485	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
6		simpl 486	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
7		brab2ddw.4	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝑈)
8	6, 7	eleq12d 2855	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝑈))
9		simpr 488	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
10		brab2ddw.5	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐷 = 𝑉)
11	9, 10	eleq12d 2855	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 ∈ 𝐷 ↔ 𝐵 ∈ 𝑉))
12	8, 11	anbi12d 641	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
13	12	adantl 485	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) ↔ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)))
14	1, 5, 13	brab2dd 49413	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝜒)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141   class class class wbr 5099  {copab 5161

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162

This theorem is referenced by:  isuplem  49764