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 21726 | . . . 4 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
2 | opncldf.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
3 | opncldf.2 | . . . . . 6 ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢)) | |
4 | 2, 3 | opncldf1 21784 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐹:𝐽–1-1-onto→(Clsd‘𝐽) ∧ ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)))) |
5 | 4 | simprd 499 | . . . 4 ⊢ (𝐽 ∈ Top → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
6 | 1, 5 | syl 17 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
7 | 6 | fveq1d 6660 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵)) |
8 | 2 | cldopn 21731 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
9 | difeq2 4022 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝐵)) | |
10 | eqid 2758 | . . . 4 ⊢ (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) | |
11 | 9, 10 | fvmptg 6757 | . . 3 ⊢ ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
12 | 8, 11 | mpdan 686 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
13 | 7, 12 | eqtrd 2793 | 1 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ∖ cdif 3855 ∪ cuni 4798 ↦ cmpt 5112 ◡ccnv 5523 –1-1-onto→wf1o 6334 ‘cfv 6335 Topctop 21593 Clsdccld 21716 |
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-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pow 5234 ax-pr 5298 ax-un 7459 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-rab 3079 df-v 3411 df-sbc 3697 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-nul 4226 df-if 4421 df-pw 4496 df-sn 4523 df-pr 4525 df-op 4529 df-uni 4799 df-br 5033 df-opab 5095 df-mpt 5113 df-id 5430 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-rn 5535 df-iota 6294 df-fun 6337 df-fn 6338 df-f 6339 df-f1 6340 df-fo 6341 df-f1o 6342 df-fv 6343 df-top 21594 df-cld 21719 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |