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

Theorem dfin2 4216
Description: An alternate definition of the intersection of two classes in terms of class difference, requiring no dummy variables. See comments under dfun2 4215. Another version is given by dfin4 4223. (Contributed by NM, 10-Jun-2004.)
Assertion
Ref Expression
dfin2 (𝐴 ∩ 𝐵) = (𝐴 ∖ (V ∖ 𝐵))

Proof of Theorem dfin2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 velcomp 4054 . . . . 5 (𝑥 ∈ (V ∖ 𝐵) ↔ ¬ 𝑥 ∈ 𝐵)
21con2bii 360 . . . 4 (𝑥 ∈ 𝐵 ↔ ¬ 𝑥 ∈ (V ∖ 𝐵))
32anbi2i 635 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
4 eldif 4049 . . 3 (𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
53, 4bitr4i 281 . 2 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)))
65ineqri 4109 1 (𝐴 ∩ 𝐵) = (𝐴 ∖ (V ∖ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4045   ∩ cin 4089
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-dif 4047  df-in 4091
This theorem is used by:  dfun3  4221  dfin3  4222  invdif  4224  difundi  4235  difindi  4237  difdif2  4241
  Copyright terms: Public domain W3C validator