Theorem dfun2 4239

Description: An alternate definition of the union of two classes in terms of class difference, requiring no dummy variables. Along with dfin2 4240 and dfss4 4238 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.

Step	Hyp	Ref	Expression
1		vex 3500	. . . . . . 7 ⊢ 𝑥 ∈ V
2		eldif 3949	. . . . . . 7 ⊢ (𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ 𝐴))
3	1, 2	mpbiran 707	. . . . . 6 ⊢ (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥 ∈ 𝐴)
4	3	anbi1i 625	. . . . 5 ⊢ ((𝑥 ∈ (V ∖ 𝐴) ∧ ¬ 𝑥 ∈ 𝐵) ↔ (¬ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
5		eldif 3949	. . . . 5 ⊢ (𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵) ↔ (𝑥 ∈ (V ∖ 𝐴) ∧ ¬ 𝑥 ∈ 𝐵))
6		ioran 980	. . . . 5 ⊢ (¬ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ (¬ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
7	4, 5, 6	3bitr4i 305	. . . 4 ⊢ (𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵) ↔ ¬ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
8	7	con2bii 360	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵))
9		eldif 3949	. . . 4 ⊢ (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵)))
10	1, 9	mpbiran 707	. . 3 ⊢ (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) ↔ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∖ 𝐵))
11	8, 10	bitr4i 280	. 2 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)))
12	11	uneqri 4130	1 ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∖ 𝐵))

Syntax hints:  ¬ wn 3   ∧ wa 398   ∨ wo 843   = wceq 1536   ∈ wcel 2113  Vcvv 3497   ∖ cdif 3936   ∪ cun 3937

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-v 3499  df-dif 3942  df-un 3944

This theorem is referenced by:  dfun3  4245  dfin3  4246