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 38579
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 38578 . 2 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵)
2 df-br 5087 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
31, 2xchbinx 334 1 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206  wcel 2114  Vcvv 3430  cdif 3887  cop 4574   class class class wbr 5086
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator