| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > difun1 | GIF version | ||
| Description: A relationship involving double difference and union. (Contributed by NM, 29-Aug-2004.) |
| Ref | Expression |
|---|---|
| difun1 | ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inass 3382 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | invdif 3414 | . . . 4 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (V ∖ 𝐶)) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) | |
| 3 | 1, 2 | eqtr3i 2227 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) |
| 4 | undm 3430 | . . . . 5 ⊢ (V ∖ (𝐵 ∪ 𝐶)) = ((V ∖ 𝐵) ∩ (V ∖ 𝐶)) | |
| 5 | 4 | ineq2i 3370 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) |
| 6 | invdif 3414 | . . . 4 ⊢ (𝐴 ∩ (V ∖ (𝐵 ∪ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) | |
| 7 | 5, 6 | eqtr3i 2227 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 8 | 3, 7 | eqtr3i 2227 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = (𝐴 ∖ (𝐵 ∪ 𝐶)) |
| 9 | invdif 3414 | . . 3 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 10 | 9 | difeq1i 3286 | . 2 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∖ 𝐶) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| 11 | 8, 10 | eqtr3i 2227 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∖ 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1372 Vcvv 2771 ∖ cdif 3162 ∪ cun 3163 ∩ cin 3164 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-rab 2492 df-v 2773 df-dif 3167 df-un 3169 df-in 3171 |
| This theorem is referenced by: dif32 3435 difabs 3436 difpr 3774 diffifi 6990 difinfinf 7202 |
| Copyright terms: Public domain | W3C validator |