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

Theorem brab 4996
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 4992 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵𝜒))
71, 2, 6mp2an 708 1 (𝐴𝑅𝐵𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1482  wcel 1989  Vcvv 3198   class class class wbr 4651  {copab 4710
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-sep 4779  ax-nul 4787  ax-pr 4904
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-rab 2920  df-v 3200  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-nul 3914  df-if 4085  df-sn 4176  df-pr 4178  df-op 4182  df-br 4652  df-opab 4711
This theorem is referenced by:  opbrop  5196  f1oweALT  7149  frxp  7284  fnwelem  7289  dftpos4  7368  dfac3  8941  axdc2lem  9267  brdom7disj  9350  brdom6disj  9351  ordpipq  9761  ltresr  9958  shftfn  13807  2shfti  13814  ishpg  25645  brcgr  25774  ex-opab  27273  br8d  29406  br8  31632  br6  31633  br4  31634  poseq  31734  dfbigcup2  31990  brsegle  32199  heiborlem2  33591
  Copyright terms: Public domain W3C validator