![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difdif | Structured version Visualization version GIF version |
Description: Double class difference. Exercise 11 of [TakeutiZaring] p. 22. (Contributed by NM, 17-May-1998.) |
Ref | Expression |
---|---|
difdif | ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm4.45im 826 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴))) | |
2 | iman 405 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴) ↔ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
3 | eldif 3891 | . . . . 5 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
4 | 2, 3 | xchbinxr 338 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴) ↔ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)) |
5 | 4 | anbi2i 625 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴)) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴))) |
6 | 1, 5 | bitr2i 279 | . 2 ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)) ↔ 𝑥 ∈ 𝐴) |
7 | 6 | difeqri 4052 | 1 ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-dif 3884 |
This theorem is referenced by: dif0 4286 undifabs 4384 |
Copyright terms: Public domain | W3C validator |