![]() |
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 4961 | . . . . . 6 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ ∪ 𝐽) | |
2 | iscld.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 1, 2 | sseqtrrdi 4060 | . . . . 5 ⊢ (𝐴 ∈ 𝐽 → 𝐴 ⊆ 𝑋) |
4 | 3 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ⊆ 𝑋) |
5 | dfss2 3994 | . . . 4 ⊢ (𝐴 ⊆ 𝑋 ↔ (𝐴 ∩ 𝑋) = 𝐴) | |
6 | 4, 5 | sylib 218 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ 𝑋) = 𝐴) |
7 | 6 | difeq1d 4148 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) = (𝐴 ∖ 𝐵)) |
8 | indif2 4300 | . . 3 ⊢ (𝐴 ∩ (𝑋 ∖ 𝐵)) = ((𝐴 ∩ 𝑋) ∖ 𝐵) | |
9 | cldrcl 23055 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
10 | 9 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top) |
11 | simpl 482 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → 𝐴 ∈ 𝐽) | |
12 | 2 | cldopn 23060 | . . . . 5 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
13 | 12 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
14 | inopn 22926 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽 ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) | |
15 | 10, 11, 13, 14 | syl3anc 1371 | . . 3 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∩ (𝑋 ∖ 𝐵)) ∈ 𝐽) |
16 | 8, 15 | eqeltrrid 2849 | . 2 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → ((𝐴 ∩ 𝑋) ∖ 𝐵) ∈ 𝐽) |
17 | 7, 16 | eqeltrrd 2845 | 1 ⊢ ((𝐴 ∈ 𝐽 ∧ 𝐵 ∈ (Clsd‘𝐽)) → (𝐴 ∖ 𝐵) ∈ 𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∖ cdif 3973 ∩ cin 3975 ⊆ wss 3976 ∪ cuni 4931 ‘cfv 6573 Topctop 22920 Clsdccld 23045 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fn 6576 df-fv 6581 df-top 22921 df-cld 23048 |
This theorem is referenced by: bcthlem5 25381 cldssbrsiga 34151 pibt2 37383 poimirlem30 37610 dirkercncflem2 46025 fourierdlem62 46089 |
Copyright terms: Public domain | W3C validator |