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

Theorem pconncn 35052
Description: The property of being a path-connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
Hypothesis
Ref Expression
ispconn.1 𝑋 = 𝐽
Assertion
Ref Expression
pconncn ((𝐽 ∈ PConn ∧ 𝐴𝑋𝐵𝑋) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝑓,𝐽
Allowed substitution hint:   𝑋(𝑓)

Proof of Theorem pconncn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ispconn.1 . . . . 5 𝑋 = 𝐽
21ispconn 35051 . . . 4 (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥𝑋𝑦𝑋𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
32simprbi 495 . . 3 (𝐽 ∈ PConn → ∀𝑥𝑋𝑦𝑋𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦))
4 eqeq2 2738 . . . . . 6 (𝑥 = 𝐴 → ((𝑓‘0) = 𝑥 ↔ (𝑓‘0) = 𝐴))
54anbi1d 629 . . . . 5 (𝑥 = 𝐴 → (((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) ↔ ((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝑦)))
65rexbidv 3169 . . . 4 (𝑥 = 𝐴 → (∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) ↔ ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝑦)))
7 eqeq2 2738 . . . . . 6 (𝑦 = 𝐵 → ((𝑓‘1) = 𝑦 ↔ (𝑓‘1) = 𝐵))
87anbi2d 628 . . . . 5 (𝑦 = 𝐵 → (((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝑦) ↔ ((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵)))
98rexbidv 3169 . . . 4 (𝑦 = 𝐵 → (∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝑦) ↔ ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵)))
106, 9rspc2v 3619 . . 3 ((𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵)))
113, 10syl5com 31 . 2 (𝐽 ∈ PConn → ((𝐴𝑋𝐵𝑋) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵)))
12113impib 1113 1 ((𝐽 ∈ PConn ∧ 𝐴𝑋𝐵𝑋) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  w3a 1084   = wceq 1534  wcel 2099  wral 3051  wrex 3060   cuni 4913  cfv 6554  (class class class)co 7424  0cc0 11158  1c1 11159  Topctop 22886   Cn ccn 23219  IIcii 24886  PConncpconn 35047
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2697
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2704  df-cleq 2718  df-clel 2803  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3464  df-dif 3950  df-un 3952  df-ss 3964  df-nul 4326  df-if 4534  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-br 5154  df-iota 6506  df-fv 6562  df-ov 7427  df-pconn 35049
This theorem is referenced by:  cnpconn  35058  pconnconn  35059  txpconn  35060  ptpconn  35061  connpconn  35063  pconnpi1  35065  cvmlift3lem2  35148  cvmlift3lem7  35153
  Copyright terms: Public domain W3C validator