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

Theorem ddif 4113
Description: Double complement under universal class. Exercise 4.10(s) of [Mendelson] p. 231. (Contributed by NM, 8-Jan-2002.)
Assertion
Ref Expression
ddif (V ∖ (V ∖ 𝐴)) = 𝐴

Proof of Theorem ddif
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 vex 3498 . . . . 5 𝑥 ∈ V
2 eldif 3946 . . . . 5 (𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥𝐴))
31, 2mpbiran 707 . . . 4 (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥𝐴)
43con2bii 360 . . 3 (𝑥𝐴 ↔ ¬ 𝑥 ∈ (V ∖ 𝐴))
51biantrur 533 . . 3 𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ (V ∖ 𝐴)))
64, 5bitr2i 278 . 2 ((𝑥 ∈ V ∧ ¬ 𝑥 ∈ (V ∖ 𝐴)) ↔ 𝑥𝐴)
76difeqri 4101 1 (V ∖ (V ∖ 𝐴)) = 𝐴
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 398   = wceq 1533  wcel 2110  Vcvv 3495  cdif 3933
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3497  df-dif 3939
This theorem is referenced by:  complss  4123  dfun3  4242  dfin3  4243  invdif  4245  ssindif0  4413  difdifdir  4437
  Copyright terms: Public domain W3C validator