![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > difres | Structured version Visualization version GIF version |
Description: Case when class difference in unaffected by restriction. (Contributed by Thierry Arnoux, 1-Jan-2020.) |
Ref | Expression |
---|---|
difres | ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ↾ 𝐵)) = (𝐴 ∖ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-res 5531 | . . 3 ⊢ (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V)) | |
2 | 1 | difeq2i 4047 | . 2 ⊢ (𝐴 ∖ (𝐶 ↾ 𝐵)) = (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) |
3 | difindi 4208 | . . . 4 ⊢ (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = ((𝐴 ∖ 𝐶) ∪ (𝐴 ∖ (𝐵 × V))) | |
4 | ssdif 4067 | . . . . . . 7 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) ⊆ ((𝐵 × V) ∖ (𝐵 × V))) | |
5 | difid 4284 | . . . . . . 7 ⊢ ((𝐵 × V) ∖ (𝐵 × V)) = ∅ | |
6 | 4, 5 | sseqtrdi 3965 | . . . . . 6 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) ⊆ ∅) |
7 | ss0 4306 | . . . . . 6 ⊢ ((𝐴 ∖ (𝐵 × V)) ⊆ ∅ → (𝐴 ∖ (𝐵 × V)) = ∅) | |
8 | 6, 7 | syl 17 | . . . . 5 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐵 × V)) = ∅) |
9 | 8 | uneq2d 4090 | . . . 4 ⊢ (𝐴 ⊆ (𝐵 × V) → ((𝐴 ∖ 𝐶) ∪ (𝐴 ∖ (𝐵 × V))) = ((𝐴 ∖ 𝐶) ∪ ∅)) |
10 | 3, 9 | syl5eq 2845 | . . 3 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = ((𝐴 ∖ 𝐶) ∪ ∅)) |
11 | un0 4298 | . . 3 ⊢ ((𝐴 ∖ 𝐶) ∪ ∅) = (𝐴 ∖ 𝐶) | |
12 | 10, 11 | eqtrdi 2849 | . 2 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ∩ (𝐵 × V))) = (𝐴 ∖ 𝐶)) |
13 | 2, 12 | syl5eq 2845 | 1 ⊢ (𝐴 ⊆ (𝐵 × V) → (𝐴 ∖ (𝐶 ↾ 𝐵)) = (𝐴 ∖ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 Vcvv 3441 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 × cxp 5517 ↾ cres 5521 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-res 5531 |
This theorem is referenced by: qtophaus 31189 |
Copyright terms: Public domain | W3C validator |