![]() |
Mathbox for Brendan Leahy |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > imadifss | Structured version Visualization version GIF version |
Description: The difference of images is a subset of the image of the difference. (Contributed by Brendan Leahy, 21-Aug-2020.) |
Ref | Expression |
---|---|
imadifss | ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssun2 4166 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
2 | undif2 4469 | . . . . 5 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
3 | 1, 2 | sseqtrri 4012 | . . . 4 ⊢ 𝐴 ⊆ (𝐵 ∪ (𝐴 ∖ 𝐵)) |
4 | imass2 6087 | . . . 4 ⊢ (𝐴 ⊆ (𝐵 ∪ (𝐴 ∖ 𝐵)) → (𝐹 “ 𝐴) ⊆ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵)))) | |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ (𝐹 “ 𝐴) ⊆ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵))) |
6 | imaundi 6135 | . . 3 ⊢ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵))) = ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) | |
7 | 5, 6 | sseqtri 4011 | . 2 ⊢ (𝐹 “ 𝐴) ⊆ ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) |
8 | ssundif 4478 | . 2 ⊢ ((𝐹 “ 𝐴) ⊆ ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) ↔ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵))) | |
9 | 7, 8 | mpbi 229 | 1 ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ∖ cdif 3938 ∪ cun 3939 ⊆ wss 3941 “ cima 5669 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3430 df-v 3472 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4520 df-sn 4620 df-pr 4622 df-op 4626 df-br 5139 df-opab 5201 df-xp 5672 df-cnv 5674 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 |
This theorem is referenced by: poimirlem30 36306 |
Copyright terms: Public domain | W3C validator |