Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opncldf3 | Structured version Visualization version GIF version |
Description: The values of the converse/inverse of the open-closed bijection. (Contributed by Jeff Hankins, 27-Aug-2009.) (Proof shortened by Mario Carneiro, 1-Sep-2015.) |
Ref | Expression |
---|---|
opncldf.1 | ⊢ 𝑋 = ∪ 𝐽 |
opncldf.2 | ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢)) |
Ref | Expression |
---|---|
opncldf3 | ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cldrcl 22085 | . . . 4 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
2 | opncldf.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | opncldf.2 | . . . . . 6 ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢)) | |
4 | 2, 3 | opncldf1 22143 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐹:𝐽–1-1-onto→(Clsd‘𝐽) ∧ ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)))) |
5 | 4 | simprd 495 | . . . 4 ⊢ (𝐽 ∈ Top → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
6 | 1, 5 | syl 17 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
7 | 6 | fveq1d 6758 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵)) |
8 | 2 | cldopn 22090 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
9 | difeq2 4047 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝐵)) | |
10 | eqid 2738 | . . . 4 ⊢ (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) | |
11 | 9, 10 | fvmptg 6855 | . . 3 ⊢ ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
12 | 8, 11 | mpdan 683 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
13 | 7, 12 | eqtrd 2778 | 1 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 ∖ cdif 3880 ∪ cuni 4836 ↦ cmpt 5153 ◡ccnv 5579 –1-1-onto→wf1o 6417 ‘cfv 6418 Topctop 21950 Clsdccld 22075 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-top 21951 df-cld 22078 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |