Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnntri | Structured version Visualization version GIF version |
Description: Property of the preimage of an interior. (Contributed by Mario Carneiro, 25-Aug-2015.) |
Ref | Expression |
---|---|
cncls2i.1 | ⊢ 𝑌 = ∪ 𝐾 |
Ref | Expression |
---|---|
cnntri | ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑆))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cntop1 22299 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
2 | 1 | adantr 480 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → 𝐽 ∈ Top) |
3 | cnvimass 5978 | . . 3 ⊢ (◡𝐹 “ 𝑆) ⊆ dom 𝐹 | |
4 | eqid 2738 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
5 | cncls2i.1 | . . . . . 6 ⊢ 𝑌 = ∪ 𝐾 | |
6 | 4, 5 | cnf 22305 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶𝑌) |
7 | 6 | fdmd 6595 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → dom 𝐹 = ∪ 𝐽) |
8 | 7 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → dom 𝐹 = ∪ 𝐽) |
9 | 3, 8 | sseqtrid 3969 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ 𝑆) ⊆ ∪ 𝐽) |
10 | cntop2 22300 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top) | |
11 | 5 | ntropn 22108 | . . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ∈ 𝐾) |
12 | 10, 11 | sylan 579 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ∈ 𝐾) |
13 | cnima 22324 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ ((int‘𝐾)‘𝑆) ∈ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽) | |
14 | 12, 13 | syldan 590 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽) |
15 | 5 | ntrss2 22116 | . . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ⊆ 𝑆) |
16 | 10, 15 | sylan 579 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ⊆ 𝑆) |
17 | imass2 5999 | . . 3 ⊢ (((int‘𝐾)‘𝑆) ⊆ 𝑆 → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆)) | |
18 | 16, 17 | syl 17 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆)) |
19 | 4 | ssntr 22117 | . 2 ⊢ (((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑆) ⊆ ∪ 𝐽) ∧ ((◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽 ∧ (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆))) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑆))) |
20 | 2, 9, 14, 18, 19 | syl22anc 835 | 1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑆))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ⊆ wss 3883 ∪ cuni 4836 ◡ccnv 5579 dom cdm 5580 “ cima 5583 ‘cfv 6418 (class class class)co 7255 Topctop 21950 intcnt 22076 Cn ccn 22283 |
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-map 8575 df-top 21951 df-topon 21968 df-ntr 22079 df-cn 22286 |
This theorem is referenced by: cnntr 22334 hmeontr 22828 cnneiima 46098 |
Copyright terms: Public domain | W3C validator |