Theorem brab 5422

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 5418	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜒))
7	1, 2, 6	mp2an 690	1 ⊢ (𝐴𝑅𝐵 ↔ 𝜒)

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1533   ∈ wcel 2110  Vcvv 3494   class class class wbr 5058  {copab 5120

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121

This theorem is referenced by:  opbrop  5642  f1oweALT  7667  frxp  7814  fnwelem  7819  dftpos4  7905  dfac3  9541  axdc2lem  9864  brdom7disj  9947  brdom6disj  9948  ordpipq  10358  ltresr  10556  shftfn  14426  2shfti  14433  ishpg  26539  brcgr  26680  ex-opab  28205  br8d  30355  br8  32987  br6  32988  br4  32989  poseq  33090  dfbigcup2  33355  brsegle  33564  heiborlem2  35084