Theorem brabg 5494

Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.) (Revised by Mario Carneiro, 19-Dec-2013.)

Hypotheses

Ref	Expression
opelopabg.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
opelopabg.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
brabg.5	⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Assertion

Ref	Expression
brabg	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒))

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

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

Proof of Theorem brabg

Step	Hyp	Ref	Expression
1		opelopabg.1	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2		opelopabg.2	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
3	1, 2	sylan9bb 509	. 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜒))
4		brabg.5	. 2 ⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
5	3, 4	brabga 5489	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   class class class wbr 5102  {copab 5164

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 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382

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-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-br 5103  df-opab 5165

This theorem is referenced by:  brab  5498  ideqg  5805  brcnvg  5833  f1owe  7310  brrpssg  7681  soseq  8115  breng  8904  brdom2g  8906  brwdom  9496  brttrcl  9642  ltprord  10959  shftfib  15014  efgrelexlema  19663  isref  23429  sltval  27592  brsslt  27731  lrrecval  27886  istrkgld  28439  islnopp  28719  axcontlem5  28948  cmbr  31563  leopg  32101  cvbr  32261  mdbr  32273  dmdbr  32278  isfne  36320  brabg2  37704  isriscg  37971  brssr  38485  lcvbr  39007  bropabg  43305