Theorem opelvvdif 39116

Description: Negated elementhood of ordered pair. (Contributed by Peter Mazsa, 14-Jan-2019.)

Assertion

Ref	Expression
opelvvdif	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))

Proof of Theorem opelvvdif

Step	Hyp	Ref	Expression
1		eldif 3908	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))
2		opelvvg 5688	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ⟨𝐴, 𝐵⟩ ∈ (V × V))
3	2	biantrurd 542	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)))
4	1, 3	bitr4id 293	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  Vcvv 3450   ∖ cdif 3895  ⟨cop 4589   × cxp 5645

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 5248  ax-pr 5390

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 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5167  df-xp 5653

This theorem is used by:  vvdifopab  39117  brvvdif  39120