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 825 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴))) | |
2 | iman 404 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴) ↔ ¬ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
3 | eldif 3946 | . . . . 5 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
4 | 2, 3 | xchbinxr 337 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴) ↔ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)) |
5 | 4 | anbi2i 624 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴)) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴))) |
6 | 1, 5 | bitr2i 278 | . 2 ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ (𝐵 ∖ 𝐴)) ↔ 𝑥 ∈ 𝐴) |
7 | 6 | difeqri 4101 | 1 ⊢ (𝐴 ∖ (𝐵 ∖ 𝐴)) = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∖ cdif 3933 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3939 |
This theorem is referenced by: dif0 4332 undifabs 4426 |
Copyright terms: Public domain | W3C validator |