| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > conncn | Structured version Visualization version GIF version | ||
| Description: A continuous function from a connected topology with one point in a clopen set must lie entirely within the set. (Contributed by Mario Carneiro, 16-Feb-2015.) |
| Ref | Expression |
|---|---|
| conncn.x | ⊢ 𝑋 = ∪ 𝐽 |
| conncn.j | ⊢ (𝜑 → 𝐽 ∈ Conn) |
| conncn.f | ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) |
| conncn.u | ⊢ (𝜑 → 𝑈 ∈ 𝐾) |
| conncn.c | ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾)) |
| conncn.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| conncn.1 | ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈) |
| Ref | Expression |
|---|---|
| conncn | ⊢ (𝜑 → 𝐹:𝑋⟶𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | conncn.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 2 | conncn.x | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | eqid 2736 | . . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 4 | 2, 3 | cnf 23211 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋⟶∪ 𝐾) |
| 5 | 1, 4 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹:𝑋⟶∪ 𝐾) |
| 6 | 5 | ffnd 6669 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝑋) |
| 7 | 5 | frnd 6676 | . . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ∪ 𝐾) |
| 8 | conncn.j | . . . 4 ⊢ (𝜑 → 𝐽 ∈ Conn) | |
| 9 | dffn4 6758 | . . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹) | |
| 10 | 6, 9 | sylib 218 | . . . . 5 ⊢ (𝜑 → 𝐹:𝑋–onto→ran 𝐹) |
| 11 | cntop2 23206 | . . . . . . . 8 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top) | |
| 12 | 1, 11 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Top) |
| 13 | 3 | restuni 23127 | . . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ ran 𝐹 ⊆ ∪ 𝐾) → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹)) |
| 14 | 12, 7, 13 | syl2anc 585 | . . . . . 6 ⊢ (𝜑 → ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹)) |
| 15 | foeq3 6750 | . . . . . 6 ⊢ (ran 𝐹 = ∪ (𝐾 ↾t ran 𝐹) → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹))) | |
| 16 | 14, 15 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐹:𝑋–onto→ran 𝐹 ↔ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹))) |
| 17 | 10, 16 | mpbid 232 | . . . 4 ⊢ (𝜑 → 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹)) |
| 18 | toptopon2 22883 | . . . . . . 7 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾)) | |
| 19 | 12, 18 | sylib 218 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘∪ 𝐾)) |
| 20 | ssidd 3945 | . . . . . 6 ⊢ (𝜑 → ran 𝐹 ⊆ ran 𝐹) | |
| 21 | cnrest2 23251 | . . . . . 6 ⊢ ((𝐾 ∈ (TopOn‘∪ 𝐾) ∧ ran 𝐹 ⊆ ran 𝐹 ∧ ran 𝐹 ⊆ ∪ 𝐾) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))) | |
| 22 | 19, 20, 7, 21 | syl3anc 1374 | . . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹)))) |
| 23 | 1, 22 | mpbid 232 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) |
| 24 | eqid 2736 | . . . . 5 ⊢ ∪ (𝐾 ↾t ran 𝐹) = ∪ (𝐾 ↾t ran 𝐹) | |
| 25 | 24 | cnconn 23387 | . . . 4 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→∪ (𝐾 ↾t ran 𝐹) ∧ 𝐹 ∈ (𝐽 Cn (𝐾 ↾t ran 𝐹))) → (𝐾 ↾t ran 𝐹) ∈ Conn) |
| 26 | 8, 17, 23, 25 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝐾 ↾t ran 𝐹) ∈ Conn) |
| 27 | conncn.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝐾) | |
| 28 | conncn.1 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑈) | |
| 29 | conncn.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 30 | fnfvelrn 7032 | . . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐹) | |
| 31 | 6, 29, 30 | syl2anc 585 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐴) ∈ ran 𝐹) |
| 32 | inelcm 4405 | . . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑈 ∧ (𝐹‘𝐴) ∈ ran 𝐹) → (𝑈 ∩ ran 𝐹) ≠ ∅) | |
| 33 | 28, 31, 32 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑈 ∩ ran 𝐹) ≠ ∅) |
| 34 | conncn.c | . . 3 ⊢ (𝜑 → 𝑈 ∈ (Clsd‘𝐾)) | |
| 35 | 3, 7, 26, 27, 33, 34 | connsubclo 23389 | . 2 ⊢ (𝜑 → ran 𝐹 ⊆ 𝑈) |
| 36 | df-f 6502 | . 2 ⊢ (𝐹:𝑋⟶𝑈 ↔ (𝐹 Fn 𝑋 ∧ ran 𝐹 ⊆ 𝑈)) | |
| 37 | 6, 35, 36 | sylanbrc 584 | 1 ⊢ (𝜑 → 𝐹:𝑋⟶𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 ∪ cuni 4850 ran crn 5632 Fn wfn 6493 ⟶wf 6494 –onto→wfo 6496 ‘cfv 6498 (class class class)co 7367 ↾t crest 17383 Topctop 22858 TopOnctopon 22875 Clsdccld 22981 Cn ccn 23189 Conncconn 23376 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-map 8775 df-en 8894 df-fin 8897 df-fi 9324 df-rest 17385 df-topgen 17406 df-top 22859 df-topon 22876 df-bases 22911 df-cld 22984 df-cn 23192 df-conn 23377 |
| This theorem is referenced by: pconnconn 35413 cvmliftmolem1 35463 cvmlift2lem9 35493 cvmlift3lem6 35506 |
| Copyright terms: Public domain | W3C validator |