Theorem brab 5498

Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.)

Hypotheses

Ref	Expression
opelopab.1	⊢ 𝐴 ∈ V
opelopab.2	⊢ 𝐵 ∈ V
opelopab.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
opelopab.4	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
brab.5	⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Assertion

Ref	Expression
brab	⊢ (𝐴𝑅𝐵 ↔ 𝜒)

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

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

Proof of Theorem brab

Step	Hyp	Ref	Expression
1		opelopab.1	. 2 ⊢ 𝐴 ∈ V
2		opelopab.2	. 2 ⊢ 𝐵 ∈ V
3		opelopab.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
4		opelopab.4	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
5		brab.5	. . 3 ⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
6	3, 4, 5	brabg 5494	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜒))
7	1, 2, 6	mp2an 693	1 ⊢ (𝐴𝑅𝐵 ↔ 𝜒)

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114  Vcvv 3429   class class class wbr 5085  {copab 5147

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148

This theorem is referenced by:  opbrop  5729  f1oweALT  7925  frxp  8076  fnwelem  8081  xpord2lem  8092  xpord3lem  8099  poseq  8108  dftpos4  8195  dfac3  10043  axdc2lem  10370  brdom7disj  10453  brdom6disj  10454  ordpipq  10865  ltresr  11063  shftfn  15035  2shfti  15042  ishpg  28827  brcgr  28969  ex-opab  30502  br8d  32681  fineqvnttrclselem3  35267  fineqvnttrclse  35268  vonf1owev  35290  br8  35938  br6  35939  br4  35940  dfbigcup2  36079  brsegle  36290  heiborlem2  38133