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

Theorem dfin2 4219
Description: An alternate definition of the intersection of two classes in terms of class difference, requiring no dummy variables. See comments under dfun2 4218. Another version is given by dfin4 4226. (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 4057 . . . . 5 (𝑥 ∈ (V ∖ 𝐵) ↔ ¬ 𝑥 ∈ 𝐵)
21con2bii 360 . . . 4 (𝑥 ∈ 𝐵 ↔ ¬ 𝑥 ∈ (V ∖ 𝐵))
32anbi2i 635 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
4 eldif 4052 . . 3 (𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (V ∖ 𝐵)))
53, 4bitr4i 281 . 2 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ (V ∖ 𝐵)))
65ineqri 4112 1 (𝐴 ∩ 𝐵) = (𝐴 ∖ (V ∖ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-dif 4050  df-in 4094
This theorem is used by:  dfun3  4224  dfin3  4225  invdif  4227  difundi  4238  difindi  4240  difdif2  4244
  Copyright terms: Public domain W3C validator