Theorem ispconn 35290

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
ispconn	⊢ (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))

Distinct variable groups:   𝑥,𝑓,𝑦,𝐽   𝑥,𝑋,𝑦

Allowed substitution hint:   𝑋(𝑓)

Proof of Theorem ispconn

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unieq 4871	. . . 4 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
2		ispconn.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
3	1, 2	eqtr4di 2786	. . 3 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋)
4		oveq2 7362	. . . . 5 ⊢ (𝑗 = 𝐽 → (II Cn 𝑗) = (II Cn 𝐽))
5	4	rexeqdv 3294	. . . 4 ⊢ (𝑗 = 𝐽 → (∃𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) ↔ ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
6	3, 5	raleqbidv 3313	. . 3 ⊢ (𝑗 = 𝐽 → (∀𝑦 ∈ ∪ 𝑗∃𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) ↔ ∀𝑦 ∈ 𝑋 ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
7	3, 6	raleqbidv 3313	. 2 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ ∪ 𝑗∀𝑦 ∈ ∪ 𝑗∃𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
8		df-pconn 35288	. 2 ⊢ PConn = {𝑗 ∈ Top ∣ ∀𝑥 ∈ ∪ 𝑗∀𝑦 ∈ ∪ 𝑗∃𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)}
9	7, 8	elrab2 3646	1 ⊢ (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057  ∪ cuni 4860  ‘cfv 6488  (class class class)co 7354  0cc0 11015  1c1 11016  Topctop 22811   Cn ccn 23142  IIcii 24798  PConncpconn 35286

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-iota 6444  df-fv 6496  df-ov 7357  df-pconn 35288

This theorem is referenced by:  pconncn  35291  pconntop  35292  cnpconn  35297  txpconn  35299  ptpconn  35300  indispconn  35301  connpconn  35302  cvxpconn  35309