![]() |
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 4189 | . . . . 5 ⊢ 𝐴 ⊆ (𝐵 ∪ 𝐴) | |
2 | undif2 4483 | . . . . 5 ⊢ (𝐵 ∪ (𝐴 ∖ 𝐵)) = (𝐵 ∪ 𝐴) | |
3 | 1, 2 | sseqtrri 4033 | . . . 4 ⊢ 𝐴 ⊆ (𝐵 ∪ (𝐴 ∖ 𝐵)) |
4 | imass2 6123 | . . . 4 ⊢ (𝐴 ⊆ (𝐵 ∪ (𝐴 ∖ 𝐵)) → (𝐹 “ 𝐴) ⊆ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵)))) | |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ (𝐹 “ 𝐴) ⊆ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵))) |
6 | imaundi 6172 | . . 3 ⊢ (𝐹 “ (𝐵 ∪ (𝐴 ∖ 𝐵))) = ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) | |
7 | 5, 6 | sseqtri 4032 | . 2 ⊢ (𝐹 “ 𝐴) ⊆ ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) |
8 | ssundif 4494 | . 2 ⊢ ((𝐹 “ 𝐴) ⊆ ((𝐹 “ 𝐵) ∪ (𝐹 “ (𝐴 ∖ 𝐵))) ↔ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵))) | |
9 | 7, 8 | mpbi 230 | 1 ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ∖ cdif 3960 ∪ cun 3961 ⊆ wss 3963 “ cima 5692 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-12 2175 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-xp 5695 df-cnv 5697 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 |
This theorem is referenced by: poimirlem30 37637 |
Copyright terms: Public domain | W3C validator |