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 38862
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 38861 . 2 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵)
2 df-br 5109 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
31, 2xchbinx 337 1 (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wcel 2141  Vcvv 3453  cdif 3901  cop 4594   class class class wbr 5108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5256  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator