MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brab Structured version   Visualization version   GIF version

Theorem brab 4963
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
StepHypRef Expression
1 opelopab.1 . 2 𝐴 ∈ V
2 opelopab.2 . 2 𝐵 ∈ V
3 opelopab.3 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
4 opelopab.4 . . 3 (𝑦 = 𝐵 → (𝜓𝜒))
5 brab.5 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
63, 4, 5brabg 4959 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵𝜒))
71, 2, 6mp2an 707 1 (𝐴𝑅𝐵𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1480  wcel 1992  Vcvv 3191   class class class wbr 4618  {copab 4677
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-sep 4746  ax-nul 4754  ax-pr 4872
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-rab 2921  df-v 3193  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-br 4619  df-opab 4679
This theorem is referenced by:  opbrop  5164  f1oweALT  7100  frxp  7233  fnwelem  7238  dftpos4  7317  dfac3  8889  axdc2lem  9215  brdom7disj  9298  brdom6disj  9299  ordpipq  9709  ltresr  9906  shftfn  13742  2shfti  13749  ishpg  25546  brcgr  25675  ex-opab  27137  br8d  29256  br8  31346  br6  31347  br4  31348  poseq  31443  dfbigcup2  31640  brsegle  31849  heiborlem2  33229
  Copyright terms: Public domain W3C validator