| 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 23371 | . . . 4 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) | |
| 2 | opncldf.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | opncldf.2 | . . . . . 6 ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢)) | |
| 4 | 2, 3 | opncldf1 23429 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐹:𝐽⟶1-1onto(Clsd‘𝐽) ∧ ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)))) |
| 5 | 4 | simprd 501 | . . . 4 ⊢ (𝐽 ∈ Top → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
| 6 | 1, 5 | syl 18 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))) |
| 7 | 6 | fveq1d 6907 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵)) |
| 8 | 2 | cldopn 23376 | . . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽) |
| 9 | difeq2 4060 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝐵)) | |
| 10 | eqid 2763 | . . . 4 ⊢ (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) | |
| 11 | 9, 10 | fvmptg 7011 | . . 3 ⊢ ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
| 12 | 8, 11 | mpdan 700 | . 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵)) |
| 13 | 7, 12 | eqtrd 2798 | 1 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ∖ cdif 4048 ∪ cuni 4870 ↦ cmpt 5189 ◡ccnv 5654 ⟶1-1ontowf1o 6554 ‘cfv 6555 Topctop 23238 Clsdccld 23361 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-top 23239 df-cld 23364 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |