![]() |
Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pconntop | Structured version Visualization version GIF version |
Description: A simply connected space is a topology. (Contributed by Mario Carneiro, 11-Feb-2015.) |
Ref | Expression |
---|---|
pconntop | ⊢ (𝐽 ∈ PConn → 𝐽 ∈ Top) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2798 | . . 3 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
2 | 1 | ispconn 32583 | . 2 ⊢ (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ ∪ 𝐽∀𝑦 ∈ ∪ 𝐽∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦))) |
3 | 2 | simplbi 501 | 1 ⊢ (𝐽 ∈ PConn → 𝐽 ∈ Top) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 ∪ cuni 4800 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 Topctop 21498 Cn ccn 21829 IIcii 23480 PConncpconn 32579 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-pconn 32581 |
This theorem is referenced by: sconntop 32588 pconnconn 32591 txpconn 32592 ptpconn 32593 qtoppconn 32596 pconnpi1 32597 sconnpi1 32599 cvxsconn 32603 |
Copyright terms: Public domain | W3C validator |