| 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 6197 | . . . 4 ⊢ (𝐹 “ 𝑈) ⊆ ran 𝐹 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ⊆ ran 𝐹) |
| 3 | kqval.2 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦}) | |
| 4 | 3 | kqcldsat 24052 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (◡𝐹 “ (𝐹 “ 𝑈)) = 𝑈) |
| 5 | simpr 490 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 ∈ (Clsd‘𝐽)) | |
| 6 | 4, 5 | eqeltrd 2860 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)) |
| 7 | 3 | kqffn 24044 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋) |
| 8 | dffn4 6802 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹) | |
| 9 | 7, 8 | sylib 221 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋–onto→ran 𝐹) |
| 10 | qtopcld 24032 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→ran 𝐹) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) | |
| 11 | 9, 10 | mpdan 700 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) |
| 12 | 11 | adantr 486 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → ((𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ (Clsd‘𝐽)))) |
| 13 | 2, 6, 12 | mpbir2and 726 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹))) |
| 14 | 3 | kqval 24045 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹)) |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (KQ‘𝐽) = (𝐽 qTop 𝐹)) |
| 16 | 15 | fveq2d 6889 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (Clsd‘(KQ‘𝐽)) = (Clsd‘(𝐽 qTop 𝐹))) |
| 17 | 13, 16 | eleqtrrd 2863 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑈) ∈ (Clsd‘(KQ‘𝐽))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 {crab 3412 ⊆ wss 3895 ↦ cmpt 5185 ◡ccnv 5649 ran crn 5651 “ cima 5653 Fn wfn 6533 –onto→wfo 6536 ‘cfv 6538 (class class class)co 7420 qTop cqtop 17675 TopOnctopon 23228 Clsdccld 23334 KQckq 24012 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-qtop 17679 df-top 23212 df-topon 23229 df-cld 23337 df-kq 24013 |
| This theorem is used by: kqreglem1 24060 kqnrmlem1 24062 kqnrmlem2 24063 |
| Copyright terms: Public domain | W3C validator |