| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnntri | 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 15012 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 2 | 1 | adantr 276 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → 𝐽 ∈ Top) |
| 3 | cnvimass 5106 | . . 3 ⊢ (◡𝐹 “ 𝑆) ⊆ dom 𝐹 | |
| 4 | eqid 2231 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 5 | cncls2i.1 | . . . . . 6 ⊢ 𝑌 = ∪ 𝐾 | |
| 6 | 4, 5 | cnf 15015 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶𝑌) |
| 7 | 6 | fdmd 5496 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → dom 𝐹 = ∪ 𝐽) |
| 8 | 7 | adantr 276 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → dom 𝐹 = ∪ 𝐽) |
| 9 | 3, 8 | sseqtrid 3278 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ 𝑆) ⊆ ∪ 𝐽) |
| 10 | cntop2 15013 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top) | |
| 11 | 5 | ntropn 14928 | . . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ∈ 𝐾) |
| 12 | 10, 11 | sylan 283 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ∈ 𝐾) |
| 13 | cnima 15031 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ ((int‘𝐾)‘𝑆) ∈ 𝐾) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽) | |
| 14 | 12, 13 | syldan 282 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽) |
| 15 | 5 | ntrss2 14932 | . . . 4 ⊢ ((𝐾 ∈ Top ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ⊆ 𝑆) |
| 16 | 10, 15 | sylan 283 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → ((int‘𝐾)‘𝑆) ⊆ 𝑆) |
| 17 | imass2 5119 | . . 3 ⊢ (((int‘𝐾)‘𝑆) ⊆ 𝑆 → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆)) | |
| 18 | 16, 17 | syl 14 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆)) |
| 19 | 4 | ssntr 14933 | . 2 ⊢ (((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑆) ⊆ ∪ 𝐽) ∧ ((◡𝐹 “ ((int‘𝐾)‘𝑆)) ∈ 𝐽 ∧ (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ (◡𝐹 “ 𝑆))) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑆))) |
| 20 | 2, 9, 14, 18, 19 | syl22anc 1275 | 1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆 ⊆ 𝑌) → (◡𝐹 “ ((int‘𝐾)‘𝑆)) ⊆ ((int‘𝐽)‘(◡𝐹 “ 𝑆))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ⊆ wss 3201 ∪ cuni 3898 ◡ccnv 4730 dom cdm 4731 “ cima 4734 ‘cfv 5333 (class class class)co 6028 Topctop 14808 intcnt 14904 Cn ccn 14996 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-map 6862 df-top 14809 df-topon 14822 df-ntr 14907 df-cn 14999 |
| This theorem is referenced by: cnntr 15036 hmeontr 15124 |
| Copyright terms: Public domain | W3C validator |