![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difopn | Structured version Visualization version GIF version |
Description: The difference of a closed set with an open set is open. (Contributed by Mario Carneiro, 6-Jan-2014.) |
Ref | Expression |
---|---|
iscld.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
difopn | ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∖ 𝐵) ∈ 𝐽) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elssuni 4942 | . . . . . 6 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ ∪ 𝐽) | |
2 | iscld.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 1, 2 | sseqtrrdi 4047 | . . . . 5 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ 𝑋) |
4 | 3 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ⊆ 𝑋) |
5 | dfss2 3981 | . . . 4 ⊢ (𝐴 ⊆ 𝑋 ↔ (𝐴 ∩ 𝑋) = 𝐴) | |
6 | 4, 5 | sylib 218 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ 𝑋) = 𝐴) |
7 | 6 | difeq1d 4135 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) = (𝐴 ∖ 𝐵)) |
8 | indif2 4287 | . . 3 ⊢ (𝐴 ∩ (𝑋 ∖ 𝐵)) = ((𝐴 ∩ 𝑋) ∖ 𝐵) | |
9 | cldrcl 23050 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
10 | 9 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top) |
11 | simpl 482 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ∈ 𝐽) | |
12 | 2 | cldopn 23055 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
13 | 12 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
14 | inopn 22921 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽 ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) | |
15 | 10, 11, 13, 14 | syl3anc 1370 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) |
16 | 8, 15 | eqeltrrid 2844 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) ∈ 𝐽) |
17 | 7, 16 | eqeltrrd 2840 | 1 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∖ 𝐵) ∈ 𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∖ cdif 3960 ∩ cin 3962 ⊆ wss 3963 ∪ cuni 4912 ‘cfv 6563 Topctop 22915 Clsdccld 23040 |
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-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
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-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ral 3060 df-rex 3069 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-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-iota 6516 df-fun 6565 df-fn 6566 df-fv 6571 df-top 22916 df-cld 23043 |
This theorem is referenced by: bcthlem5 25376 cldssbrsiga 34168 pibt2 37400 poimirlem30 37637 dirkercncflem2 46060 fourierdlem62 46124 |
Copyright terms: Public domain | W3C validator |