Theorem brrabga 38337

Description: The law of concretion for operation class abstraction. (Contributed by Peter Mazsa, 24-Oct-2022.)

Hypotheses

Ref	Expression
brrabga.1	⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))
brrabga.2	⊢ 𝑅 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}

Assertion

Ref	Expression
brrabga	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐴, 𝐵⟩𝑅𝐶 ↔ 𝜓))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜓,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝑅(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)   𝑊(𝑥,𝑦,𝑧)   𝑋(𝑥,𝑦,𝑧)

Proof of Theorem brrabga

Step	Hyp	Ref	Expression
1		df-br 5152	. . 3 ⊢ (⟨𝐴, 𝐵⟩𝑅𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ 𝑅)
2		brrabga.2	. . . 4 ⊢ 𝑅 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
3	2	eleq2i 2833	. . 3 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ 𝑅 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
4	1, 3	bitri 275	. 2 ⊢ (⟨𝐴, 𝐵⟩𝑅𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
5		brrabga.1	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))
6	5	eloprabga 7548	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓))
7	4, 6	bitrid 283	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐴, 𝐵⟩𝑅𝐶 ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1087   = wceq 1539   ∈ wcel 2108  ⟨cop 4640   class class class wbr 5151  {coprab 7439

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-12 2177  ax-ext 2708  ax-sep 5305  ax-nul 5315  ax-pr 5441

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3483  df-dif 3969  df-un 3971  df-ss 3983  df-nul 4343  df-if 4535  df-sn 4635  df-pr 4637  df-op 4641  df-br 5152  df-oprab 7442

This theorem is referenced by:  brcnvrabga  38338