| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > invdif | Structured version Visualization version GIF version | ||
| Description: Intersection with universal complement. Remark in [Stoll] p. 20. (Contributed by NM, 17-Aug-2004.) |
| Ref | Expression |
|---|---|
| invdif | ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfin2 4221 | . 2 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ (V ∖ (V ∖ 𝐵))) | |
| 2 | ddif 4092 | . . 3 ⊢ (V ∖ (V ∖ 𝐵)) = 𝐵 | |
| 3 | 2 | difeq2i 4075 | . 2 ⊢ (𝐴 ∖ (V ∖ (V ∖ 𝐵))) = (𝐴 ∖ 𝐵) |
| 4 | 1, 3 | eqtri 2784 | 1 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 Vcvv 3453 ∖ cdif 3899 ∩ cin 3901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3905 df-in 3909 |
| This theorem is referenced by: indif2 4231 difundi 4240 difundir 4241 difindi 4242 difindir 4243 difdif2 4246 difun1 4249 undif1 4427 difdifdir 4442 fsuppeq 8149 fsuppeqg 8150 dfsup2 9384 fsets 17196 setsdm 17197 dmxrncnvep 38849 dmcnvepres 38850 dmxrnuncnvepres 38852 |
| Copyright terms: Public domain | W3C validator |