Theorem brvvdif 39017

Description: Binary relation with the complement under the universal class of ordered pairs. (Contributed by Peter Mazsa, 9-Nov-2018.)

Assertion

Ref	Expression
brvvdif	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴((V × V) ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵))

Proof of Theorem brvvdif

Step	Hyp	Ref	Expression
1		opelvvdif 39013	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))
2		df-br 5104	. 2 ⊢ (𝐴((V × V) ∖ 𝑅)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅))
3		df-br 5104	. . 3 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
4	3	notbii 323	. 2 ⊢ (¬ 𝐴𝑅𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
5	1, 2, 4	3bitr4g 317	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴((V × V) ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  Vcvv 3450   ∖ cdif 3896  ⟨cop 4590   class class class wbr 5103   × cxp 5653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661

This theorem is used by:  brvbrvvdif  39018