Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  vvdifopab Structured version   Visualization version   GIF version

Theorem vvdifopab 39197
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
StepHypRef Expression
1 opabidw 5498 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
21notbii 323 . . . 4 (¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ¬ 𝜑)
3 opelvvdif 39196 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
43el2v 3458 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ¬ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
5 opabidw 5498 . . . 4 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ¬ 𝜑)
62, 4, 53bitr4i 306 . . 3 (⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
76gen2 1829 . 2 ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})
8 relxp 5669 . . . 4 Rel (V × V)
9 reldif 5793 . . . 4 (Rel (V × V) → Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
108, 9ax-mp 5 . . 3 Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
11 relopabv 5799 . . 3 Rel {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
12 nfcv 2923 . . . . 5 Ⅎ𝑥(V × V)
13 nfopab1 5175 . . . . 5 Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
1412, 13nfdif 4077 . . . 4 Ⅎ𝑥((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
15 nfopab1 5175 . . . 4 Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
16 nfcv 2923 . . . . 5 Ⅎ𝑦(V × V)
17 nfopab2 5176 . . . . 5 Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
1816, 17nfdif 4077 . . . 4 Ⅎ𝑦((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
19 nfopab2 5176 . . . 4 Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
2014, 15, 18, 19eqrelf 39190 . . 3 ((Rel ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ∧ Rel {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}) → (((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑})))
2110, 11, 20mp2an 705 . 2 (((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑} ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}))
227, 21mpbir 234 1 ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896  ⟨cop 4590  {copab 5167   × cxp 5649  Rel wrel 5656
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
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-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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-opab 5168  df-xp 5657  df-rel 5658
This theorem is used by:  dfssr2  39511
  Copyright terms: Public domain W3C validator