Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > kqcld | Structured version Visualization version GIF version |
Description: The topological indistinguishability map is a closed map. (Contributed by Mario Carneiro, 25-Aug-2015.) |
Ref | Expression |
---|---|
kqval.2 | ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦}) |
Ref | Expression |
---|---|
kqcld | ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ∈ (Clsd‘(KQ‘𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imassrn 5969 | . . . 4 ⊢ (𝐹 “ 𝑈) ⊆ ran 𝐹 | |
2 | 1 | a1i 11 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ⊆ ran 𝐹) |
3 | kqval.2 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦}) | |
4 | 3 | kqcldsat 22792 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (◡𝐹 “ (𝐹 “ 𝑈)) = 𝑈) |
5 | simpr 484 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 ∈ (Clsd‘𝐽)) | |
6 | 4, 5 | eqeltrd 2839 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)) |
7 | 3 | kqffn 22784 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋) |
8 | dffn4 6678 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹) | |
9 | 7, 8 | sylib 217 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋–onto→ran 𝐹) |
10 | qtopcld 22772 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→ran 𝐹) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) | |
11 | 9, 10 | mpdan 683 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) |
12 | 11 | adantr 480 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) |
13 | 2, 6, 12 | mpbir2and 709 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹))) |
14 | 3 | kqval 22785 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹)) |
15 | 14 | adantr 480 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (KQ‘𝐽) = (𝐽 qTop 𝐹)) |
16 | 15 | fveq2d 6760 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (Clsd‘(KQ‘𝐽)) = (Clsd‘(𝐽 qTop 𝐹))) |
17 | 13, 16 | eleqtrrd 2842 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ∈ (Clsd‘(KQ‘𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {crab 3067 ⊆ wss 3883 ↦ cmpt 5153 ◡ccnv 5579 ran crn 5581 “ cima 5583 Fn wfn 6413 –onto→wfo 6416 ‘cfv 6418 (class class class)co 7255 qTop cqtop 17131 TopOnctopon 21967 Clsdccld 22075 KQckq 22752 |
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-rep 5205 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-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 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-iun 4923 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-res 5592 df-ima 5593 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-ov 7258 df-oprab 7259 df-mpo 7260 df-qtop 17135 df-top 21951 df-topon 21968 df-cld 22078 df-kq 22753 |
This theorem is referenced by: kqreglem1 22800 kqnrmlem1 22802 kqnrmlem2 22803 |
Copyright terms: Public domain | W3C validator |