Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cnpconn Structured version   Visualization version   GIF version

Theorem cnpconn 31519
Description: An image of a path-connected space is path-connected. (Contributed by Mario Carneiro, 24-Mar-2015.)
Hypothesis
Ref Expression
cnpconn.2 𝑌 = 𝐾
Assertion
Ref Expression
cnpconn ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ PConn)

Proof of Theorem cnpconn
Dummy variables 𝑓 𝑔 𝑢 𝑣 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cntop2 21247 . . 3 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
213ad2ant3 1130 . 2 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
3 eqid 2760 . . . . . . . . 9 𝐽 = 𝐽
43pconncn 31513 . . . . . . . 8 ((𝐽 ∈ PConn ∧ 𝑢 𝐽𝑣 𝐽) → ∃𝑔 ∈ (II Cn 𝐽)((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))
543expb 1114 . . . . . . 7 ((𝐽 ∈ PConn ∧ (𝑢 𝐽𝑣 𝐽)) → ∃𝑔 ∈ (II Cn 𝐽)((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))
653ad2antl1 1201 . . . . . 6 (((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) → ∃𝑔 ∈ (II Cn 𝐽)((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))
7 simprl 811 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → 𝑔 ∈ (II Cn 𝐽))
8 simpll3 1259 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → 𝐹 ∈ (𝐽 Cn 𝐾))
9 cnco 21272 . . . . . . . 8 ((𝑔 ∈ (II Cn 𝐽) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹𝑔) ∈ (II Cn 𝐾))
107, 8, 9syl2anc 696 . . . . . . 7 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → (𝐹𝑔) ∈ (II Cn 𝐾))
11 iiuni 22885 . . . . . . . . . . 11 (0[,]1) = II
1211, 3cnf 21252 . . . . . . . . . 10 (𝑔 ∈ (II Cn 𝐽) → 𝑔:(0[,]1)⟶ 𝐽)
137, 12syl 17 . . . . . . . . 9 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → 𝑔:(0[,]1)⟶ 𝐽)
14 0elunit 12483 . . . . . . . . 9 0 ∈ (0[,]1)
15 fvco3 6437 . . . . . . . . 9 ((𝑔:(0[,]1)⟶ 𝐽 ∧ 0 ∈ (0[,]1)) → ((𝐹𝑔)‘0) = (𝐹‘(𝑔‘0)))
1613, 14, 15sylancl 697 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → ((𝐹𝑔)‘0) = (𝐹‘(𝑔‘0)))
17 simprrl 823 . . . . . . . . 9 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → (𝑔‘0) = 𝑢)
1817fveq2d 6356 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → (𝐹‘(𝑔‘0)) = (𝐹𝑢))
1916, 18eqtrd 2794 . . . . . . 7 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → ((𝐹𝑔)‘0) = (𝐹𝑢))
20 1elunit 12484 . . . . . . . . 9 1 ∈ (0[,]1)
21 fvco3 6437 . . . . . . . . 9 ((𝑔:(0[,]1)⟶ 𝐽 ∧ 1 ∈ (0[,]1)) → ((𝐹𝑔)‘1) = (𝐹‘(𝑔‘1)))
2213, 20, 21sylancl 697 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → ((𝐹𝑔)‘1) = (𝐹‘(𝑔‘1)))
23 simprrr 824 . . . . . . . . 9 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → (𝑔‘1) = 𝑣)
2423fveq2d 6356 . . . . . . . 8 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → (𝐹‘(𝑔‘1)) = (𝐹𝑣))
2522, 24eqtrd 2794 . . . . . . 7 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → ((𝐹𝑔)‘1) = (𝐹𝑣))
26 fveq1 6351 . . . . . . . . . 10 (𝑓 = (𝐹𝑔) → (𝑓‘0) = ((𝐹𝑔)‘0))
2726eqeq1d 2762 . . . . . . . . 9 (𝑓 = (𝐹𝑔) → ((𝑓‘0) = (𝐹𝑢) ↔ ((𝐹𝑔)‘0) = (𝐹𝑢)))
28 fveq1 6351 . . . . . . . . . 10 (𝑓 = (𝐹𝑔) → (𝑓‘1) = ((𝐹𝑔)‘1))
2928eqeq1d 2762 . . . . . . . . 9 (𝑓 = (𝐹𝑔) → ((𝑓‘1) = (𝐹𝑣) ↔ ((𝐹𝑔)‘1) = (𝐹𝑣)))
3027, 29anbi12d 749 . . . . . . . 8 (𝑓 = (𝐹𝑔) → (((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ (((𝐹𝑔)‘0) = (𝐹𝑢) ∧ ((𝐹𝑔)‘1) = (𝐹𝑣))))
3130rspcev 3449 . . . . . . 7 (((𝐹𝑔) ∈ (II Cn 𝐾) ∧ (((𝐹𝑔)‘0) = (𝐹𝑢) ∧ ((𝐹𝑔)‘1) = (𝐹𝑣))) → ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)))
3210, 19, 25, 31syl12anc 1475 . . . . . 6 ((((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) ∧ (𝑔 ∈ (II Cn 𝐽) ∧ ((𝑔‘0) = 𝑢 ∧ (𝑔‘1) = 𝑣))) → ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)))
336, 32rexlimddv 3173 . . . . 5 (((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑢 𝐽𝑣 𝐽)) → ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)))
3433ralrimivva 3109 . . . 4 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → ∀𝑢 𝐽𝑣 𝐽𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)))
35 cnpconn.2 . . . . . . . . 9 𝑌 = 𝐾
363, 35cnf 21252 . . . . . . . 8 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽𝑌)
37363ad2ant3 1130 . . . . . . 7 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽𝑌)
38 forn 6279 . . . . . . . 8 (𝐹:𝑋onto𝑌 → ran 𝐹 = 𝑌)
39383ad2ant2 1129 . . . . . . 7 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → ran 𝐹 = 𝑌)
40 dffo2 6280 . . . . . . 7 (𝐹: 𝐽onto𝑌 ↔ (𝐹: 𝐽𝑌 ∧ ran 𝐹 = 𝑌))
4137, 39, 40sylanbrc 701 . . . . . 6 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽onto𝑌)
42 eqeq2 2771 . . . . . . . . 9 ((𝐹𝑣) = 𝑦 → ((𝑓‘1) = (𝐹𝑣) ↔ (𝑓‘1) = 𝑦))
4342anbi2d 742 . . . . . . . 8 ((𝐹𝑣) = 𝑦 → (((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ ((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦)))
4443rexbidv 3190 . . . . . . 7 ((𝐹𝑣) = 𝑦 → (∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦)))
4544cbvfo 6707 . . . . . 6 (𝐹: 𝐽onto𝑌 → (∀𝑣 𝐽𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ ∀𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦)))
4641, 45syl 17 . . . . 5 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → (∀𝑣 𝐽𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ ∀𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦)))
4746ralbidv 3124 . . . 4 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → (∀𝑢 𝐽𝑣 𝐽𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = (𝐹𝑣)) ↔ ∀𝑢 𝐽𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦)))
4834, 47mpbid 222 . . 3 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → ∀𝑢 𝐽𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦))
49 eqeq2 2771 . . . . . . . 8 ((𝐹𝑢) = 𝑥 → ((𝑓‘0) = (𝐹𝑢) ↔ (𝑓‘0) = 𝑥))
5049anbi1d 743 . . . . . . 7 ((𝐹𝑢) = 𝑥 → (((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦) ↔ ((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
5150rexbidv 3190 . . . . . 6 ((𝐹𝑢) = 𝑥 → (∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦) ↔ ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
5251ralbidv 3124 . . . . 5 ((𝐹𝑢) = 𝑥 → (∀𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦) ↔ ∀𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
5352cbvfo 6707 . . . 4 (𝐹: 𝐽onto𝑌 → (∀𝑢 𝐽𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦) ↔ ∀𝑥𝑌𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
5441, 53syl 17 . . 3 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → (∀𝑢 𝐽𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = (𝐹𝑢) ∧ (𝑓‘1) = 𝑦) ↔ ∀𝑥𝑌𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
5548, 54mpbid 222 . 2 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → ∀𝑥𝑌𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦))
5635ispconn 31512 . 2 (𝐾 ∈ PConn ↔ (𝐾 ∈ Top ∧ ∀𝑥𝑌𝑦𝑌𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
572, 55, 56sylanbrc 701 1 ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ PConn)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1072   = wceq 1632  wcel 2139  wral 3050  wrex 3051   cuni 4588  ran crn 5267  ccom 5270  wf 6045  ontowfo 6047  cfv 6049  (class class class)co 6813  0cc0 10128  1c1 10129  [,]cicc 12371  Topctop 20900   Cn ccn 21230  IIcii 22879  PConncpconn 31508
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-mulcom 10192  ax-addass 10193  ax-mulass 10194  ax-distr 10195  ax-i2m1 10196  ax-1ne0 10197  ax-1rid 10198  ax-rnegex 10199  ax-rrecex 10200  ax-cnre 10201  ax-pre-lttri 10202  ax-pre-lttrn 10203  ax-pre-ltadd 10204  ax-pre-mulgt0 10205  ax-pre-sup 10206
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-er 7911  df-map 8025  df-en 8122  df-dom 8123  df-sdom 8124  df-sup 8513  df-inf 8514  df-pnf 10268  df-mnf 10269  df-xr 10270  df-ltxr 10271  df-le 10272  df-sub 10460  df-neg 10461  df-div 10877  df-nn 11213  df-2 11271  df-3 11272  df-n0 11485  df-z 11570  df-uz 11880  df-q 11982  df-rp 12026  df-xneg 12139  df-xadd 12140  df-xmul 12141  df-icc 12375  df-seq 12996  df-exp 13055  df-cj 14038  df-re 14039  df-im 14040  df-sqrt 14174  df-abs 14175  df-topgen 16306  df-psmet 19940  df-xmet 19941  df-met 19942  df-bl 19943  df-mopn 19944  df-top 20901  df-topon 20918  df-bases 20952  df-cn 21233  df-ii 22881  df-pconn 31510
This theorem is referenced by:  qtoppconn  31525
  Copyright terms: Public domain W3C validator