Theorem vvdifopab 38974

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 5510	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
2	1	notbii 323	. . . 4 ⊢ (¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ¬ 𝜑)
3		opelvvdif 38973	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
4	3	el2v 3464	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
5		opabidw 5510	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ¬ 𝜑)
6	2, 4, 5	3bitr4i 306	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
7	6	gen2 1829	. 2 ⊢ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
8		relxp 5681	. . . 4 ⊢ Rel (V × V)
9		reldif 5804	. . . 4 ⊢ (Rel (V × V) → Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
10	8, 9	ax-mp 5	. . 3 ⊢ Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
11		relopabv 5810	. . 3 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
12		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑥(V × V)
13		nfopab1 5183	. . . . 5 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
14	12, 13	nfdif 4084	. . . 4 ⊢ Ⅎ𝑥((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
15		nfopab1 5183	. . . 4 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
16		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑦(V × V)
17		nfopab2 5184	. . . . 5 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
18	16, 17	nfdif 4084	. . . 4 ⊢ Ⅎ𝑦((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
19		nfopab2 5184	. . . 4 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
20	14, 15, 18, 19	eqrelf 38967	. . 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 2146  Vcvv 3457   ∖ cdif 3903  ⟨cop 4597  {copab 5175   × cxp 5661  Rel wrel 5668

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-opab 5176  df-xp 5669  df-rel 5670

This theorem is used by:  dfssr2  39288