Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfun2 Structured version   Visualization version   GIF version

Theorem dfun2 4189
 Description: An alternate definition of the union of two classes in terms of class difference, requiring no dummy variables. Along with dfin2 4190 and dfss4 4188 it shows we can express union, intersection, and subset directly in terms of the single "primitive" operation ∖ (class difference). (Contributed by NM, 10-Jun-2004.)
Assertion
Ref Expression
dfun2 (𝐴𝐵) = (V ∖ ((V ∖ 𝐴) ∖ 𝐵))

Proof of Theorem dfun2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 vex 3447 . . . . . . 7 𝑥 ∈ V
2 eldif 3894 . . . . . . 7 (𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥𝐴))
31, 2mpbiran 708 . . . . . 6 (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥𝐴)
43anbi1i 626 . . . . 5 ((𝑥 ∈ (V ∖ 𝐴) ∧ ¬ 𝑥𝐵) ↔ (¬ 𝑥𝐴 ∧ ¬ 𝑥𝐵))
5 eldif 3894 . . . . 5 (𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵) ↔ (𝑥 ∈ (V ∖ 𝐴) ∧ ¬ 𝑥𝐵))
6 ioran 981 . . . . 5 (¬ (𝑥𝐴𝑥𝐵) ↔ (¬ 𝑥𝐴 ∧ ¬ 𝑥𝐵))
74, 5, 63bitr4i 306 . . . 4 (𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵) ↔ ¬ (𝑥𝐴𝑥𝐵))
87con2bii 361 . . 3 ((𝑥𝐴𝑥𝐵) ↔ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵))
9 eldif 3894 . . . 4 (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵)))
101, 9mpbiran 708 . . 3 (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) ↔ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵))
118, 10bitr4i 281 . 2 ((𝑥𝐴𝑥𝐵) ↔ 𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)))
1211uneqri 4081 1 (𝐴𝐵) = (V ∖ ((V ∖ 𝐴) ∖ 𝐵))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2112  Vcvv 3444   ∖ cdif 3881   ∪ cun 3882 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-ext 2773 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-v 3446  df-dif 3887  df-un 3889 This theorem is referenced by:  dfun3  4195  dfin3  4196
 Copyright terms: Public domain W3C validator