![]() |
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 4941 | . . . . . 6 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ ∪ 𝐽) | |
2 | iscld.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 1, 2 | sseqtrrdi 4033 | . . . . 5 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ 𝑋) |
4 | 3 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ⊆ 𝑋) |
5 | df-ss 3965 | . . . 4 ⊢ (𝐴 ⊆ 𝑋 ↔ (𝐴 ∩ 𝑋) = 𝐴) | |
6 | 4, 5 | sylib 217 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ 𝑋) = 𝐴) |
7 | 6 | difeq1d 4121 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) = (𝐴 ∖ 𝐵)) |
8 | indif2 4270 | . . 3 ⊢ (𝐴 ∩ (𝑋 ∖ 𝐵)) = ((𝐴 ∩ 𝑋) ∖ 𝐵) | |
9 | cldrcl 22763 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
10 | 9 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top) |
11 | simpl 482 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ∈ 𝐽) | |
12 | 2 | cldopn 22768 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
13 | 12 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
14 | inopn 22634 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽 ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) | |
15 | 10, 11, 13, 14 | syl3anc 1370 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) |
16 | 8, 15 | eqeltrrid 2837 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) ∈ 𝐽) |
17 | 7, 16 | eqeltrrd 2833 | 1 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∖ 𝐵) ∈ 𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ∖ cdif 3945 ∩ cin 3947 ⊆ wss 3948 ∪ cuni 4908 ‘cfv 6543 Topctop 22628 Clsdccld 22753 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-iota 6495 df-fun 6545 df-fn 6546 df-fv 6551 df-top 22629 df-cld 22756 |
This theorem is referenced by: bcthlem5 25089 cldssbrsiga 33498 pibt2 36614 poimirlem30 36834 dirkercncflem2 45131 fourierdlem62 45195 |
Copyright terms: Public domain | W3C validator |