Theorem opelvvdif 38941

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 3914	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))
2		opelvvg 5701	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ⟨𝐴, 𝐵⟩ ∈ (V × V))
3	2	biantrurd 541	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)))
4	1, 3	bitr4id 293	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∈ wcel 2142  Vcvv 3454   ∖ cdif 3901  ⟨cop 4594   × cxp 5658

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-xp 5666

This theorem is used by:  vvdifopab  38942  brvvdif  38945