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

Theorem brabg 4959
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
StepHypRef Expression
1 opelopabg.1 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
2 opelopabg.2 . . 3 (𝑦 = 𝐵 → (𝜓𝜒))
31, 2sylan9bb 735 . 2 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜒))
4 brabg.5 . 2 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
53, 4brabga 4954 1 ((𝐴𝐶𝐵𝐷) → (𝐴𝑅𝐵𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1992   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:  brab  4963  ideqg  5238  opelcnvg  5267  f1owe  6558  brrpssg  6893  bren  7909  brdomg  7910  brwdom  8417  ltprord  9797  shftfib  13741  efgrelexlema  18078  isref  21217  istrkgld  25253  islnopp  25526  axcontlem5  25743  cmbr  28283  leopg  28821  cvbr  28981  mdbr  28993  dmdbr  28998  soseq  31440  sltval  31489  isfne  31949  brabg2  33109  isriscg  33382  lcvbr  33755
  Copyright terms: Public domain W3C validator