Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brvdif2 Structured version   Visualization version   GIF version

Theorem brvdif2 38647
Description: Binary relation with universal complement. (Contributed by Peter Mazsa, 14-Jul-2018.)
Assertion
Ref Expression
brvdif2 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)

Proof of Theorem brvdif2
StepHypRef Expression
1 brvdif 38646 . 2 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵)
2 df-br 5075 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
31, 2xchbinx 336 1 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wcel 2121  Vcvv 3433  cdif 3881  cop 4563   class class class wbr 5074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5220  ax-pr 5364
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-rab 3394  df-v 3435  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-sn 4558  df-pr 4560  df-op 4564  df-br 5075
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator