Theorem dfin2 4220

Description: An alternate definition of the intersection of two classes in terms of class difference, requiring no dummy variables. See comments under dfun2 4219. Another version is given by dfin4 4227. (Contributed by NM, 10-Jun-2004.)

Assertion

Ref	Expression
dfin2	⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (V ∖ 𝐵))

Proof of Theorem dfin2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		velcomp 3917	. . . . 5 ⊢ (𝑥 ∈ (V ∖ 𝐵) ↔ ¬ 𝑥 ∈ 𝐵)
2	1	con2bii 360	. . . 4 ⊢ (𝑥 ∈ 𝐵 ↔ ¬ 𝑥 ∈ (V ∖ 𝐵))
3	2	anbi2i 635	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
4		eldif 3912	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
5	3, 4	bitr4i 281	. 2 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)))
6	5	ineqri 4161	1 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (V ∖ 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∖ cdif 3899   ∩ cin 3901

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-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-dif 3905  df-in 3909

This theorem is used by:  dfun3  4225  dfin3  4226  invdif  4228  difundi  4239  difindi  4241  difdif2  4245