Theorem vvdifopab 39463

Description: Ordered-pair class abstraction defined by a negation. (Contributed by Peter Mazsa, 25-Jun-2019.)

Assertion

Ref	Expression
vvdifopab	⊢ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem vvdifopab

Step	Hyp	Ref	Expression
1		opabidw 5505	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
2	1	notbii 323	. . . 4 ⊢ (¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ¬ 𝜑)
3		opelvvdif 39462	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
4	3	el2v 3461	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
5		opabidw 5505	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ¬ 𝜑)
6	2, 4, 5	3bitr4i 306	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
7	6	gen2 1829	. 2 ⊢ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
8		relxp 5676	. . . 4 ⊢ Rel (V × V)
9		reldif 5802	. . . 4 ⊢ (Rel (V × V) → Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
10	8, 9	ax-mp 5	. . 3 ⊢ Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
11		relopab 5812	. . 3 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
12		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑥(V × V)
13		nfopab1 5181	. . . . 5 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
14	12, 13	nfdif 4069	. . . 4 ⊢ Ⅎ𝑥((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
15		nfopab1 5181	. . . 4 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
16		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦(V × V)
17		nfopab2 5182	. . . . 5 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
18	16, 17	nfdif 4069	. . . 4 ⊢ Ⅎ𝑦((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
19		nfopab2 5182	. . . 4 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
20	14, 15, 18, 19	eqrelf 39456	. . 3 ⊢ ((Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ∧ Rel {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}) → (((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})))
21	10, 11, 20	mp2an 705	. 2 ⊢ (((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}))
22	7, 21	mpbir 234	1 ⊢ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  ⟨cop 4840  {copab 5173   × cxp 5656  Rel wrel 5663

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  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-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-xp 5664  df-rel 5665

This theorem is used by:  dfssr2  39777