cvxpconn - Mathbox for Mario Carneiro

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

Theorem cvxpconn 35436

Description: A convex subset of the complex numbers is path-connected. (Contributed by Mario Carneiro, 12-Feb-2015.) Avoid ax-mulf 11106. (Revised by GG, 19-Apr-2025.)

**Hypotheses**
Ref	Expression
cvxpconn.1	⊢ (𝜑 → 𝑆 ⊆ ℂ)
cvxpconn.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑡 ∈ (0[,]1))) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆)
cvxpconn.3	⊢ 𝐽 = (TopOpen‘ℂ_fld)
cvxpconn.4	⊢ 𝐾 = (𝐽 ↾_t 𝑆)

**Assertion**
Ref	Expression
cvxpconn	⊢ (𝜑 → 𝐾 ∈ PConn)

Distinct variable groups: 𝑡,𝐽 𝑥,𝑦,𝐾 𝑥,𝑡,𝑦,𝜑 𝑡,𝑆,𝑥 Allowed substitution hints: 𝑆(𝑦) 𝐽(𝑥,𝑦) 𝐾(𝑡)

Proof of Theorem cvxpconn Dummy variables 𝑢 𝑣 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cvxpconn.4	. . 3 ⊢ 𝐾 = (𝐽 ↾_t 𝑆)
2		cvxpconn.3	. . . . 5 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
3	2	cnfldtop 24727	. . . 4 ⊢ 𝐽 ∈ Top
4		cvxpconn.1	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
5		cnex 11107	. . . . 5 ⊢ ℂ ∈ V
6		ssexg 5268	. . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ ℂ ∈ V) → 𝑆 ∈ V)
7	4, 5, 6	sylancl 586	. . . 4 ⊢ (𝜑 → 𝑆 ∈ V)
8		resttop 23104	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ∈ V) → (𝐽 ↾_t 𝑆) ∈ Top)
9	3, 7, 8	sylancr 587	. . 3 ⊢ (𝜑 → (𝐽 ↾_t 𝑆) ∈ Top)
10	1, 9	eqeltrid 2840	. 2 ⊢ (𝜑 → 𝐾 ∈ Top)
11	2	dfii3 24832	. . . . . . . 8 ⊢ II = (𝐽 ↾_t (0[,]1))
12	2	cnfldtopon 24726	. . . . . . . . 9 ⊢ 𝐽 ∈ (TopOn‘ℂ)
13	12	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → 𝐽 ∈ (TopOn‘ℂ))
14		unitsscn 13416	. . . . . . . . 9 ⊢ (0[,]1) ⊆ ℂ
15	14	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (0[,]1) ⊆ ℂ)
16	12	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐽 ∈ (TopOn‘ℂ))
17	16	cnmptid 23605	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑡 ∈ ℂ ↦ 𝑡) ∈ (𝐽 Cn 𝐽))
18	4	sselda 3933	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ ℂ)
19	16, 16, 18	cnmptc 23606	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑡 ∈ ℂ ↦ 𝑥) ∈ (𝐽 Cn 𝐽))
20	2	mpomulcn 24814	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽)
21	20	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
22		oveq12 7367	. . . . . . . . . . 11 ⊢ ((𝑢 = 𝑡 ∧ 𝑣 = 𝑥) → (𝑢 · 𝑣) = (𝑡 · 𝑥))
23	16, 17, 19, 16, 16, 21, 22	cnmpt12 23611	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑡 ∈ ℂ ↦ (𝑡 · 𝑥)) ∈ (𝐽 Cn 𝐽))
24	23	adantrl 716	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ ℂ ↦ (𝑡 · 𝑥)) ∈ (𝐽 Cn 𝐽))
25	12	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘ℂ))
26		1cnd 11127	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 1 ∈ ℂ)
27	25, 25, 26	cnmptc 23606	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ 1) ∈ (𝐽 Cn 𝐽))
28	2	cncfcn1 24860	. . . . . . . . . . . . . 14 ⊢ (ℂ–cn→ℂ) = (𝐽 Cn 𝐽)
29	27, 28	eleqtrrdi 2847	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ 1) ∈ (ℂ–cn→ℂ))
30	25	cnmptid 23605	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ 𝑡) ∈ (𝐽 Cn 𝐽))
31	30, 28	eleqtrrdi 2847	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ 𝑡) ∈ (ℂ–cn→ℂ))
32	29, 31	subcncf 25401	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ (1 − 𝑡)) ∈ (ℂ–cn→ℂ))
33	32, 28	eleqtrdi 2846	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑡 ∈ ℂ ↦ (1 − 𝑡)) ∈ (𝐽 Cn 𝐽))
34	33	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ ℂ ↦ (1 − 𝑡)) ∈ (𝐽 Cn 𝐽))
35	4	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → 𝑆 ⊆ ℂ)
36		simprl 770	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → 𝑦 ∈ 𝑆)
37	35, 36	sseldd 3934	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → 𝑦 ∈ ℂ)
38	13, 13, 37	cnmptc 23606	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ ℂ ↦ 𝑦) ∈ (𝐽 Cn 𝐽))
39	20	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑢 ∈ ℂ, 𝑣 ∈ ℂ ↦ (𝑢 · 𝑣)) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
40		oveq12 7367	. . . . . . . . . 10 ⊢ ((𝑢 = (1 − 𝑡) ∧ 𝑣 = 𝑦) → (𝑢 · 𝑣) = ((1 − 𝑡) · 𝑦))
41	13, 34, 38, 13, 13, 39, 40	cnmpt12 23611	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ ℂ ↦ ((1 − 𝑡) · 𝑦)) ∈ (𝐽 Cn 𝐽))
42	2	addcn 24810	. . . . . . . . . 10 ⊢ + ∈ ((𝐽 ×_t 𝐽) Cn 𝐽)
43	42	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → + ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
44	13, 24, 41, 43	cnmpt12f 23610	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ ℂ ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (𝐽 Cn 𝐽))
45	11, 13, 15, 44	cnmpt1res 23620	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn 𝐽))
46		cvxpconn.2	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑡 ∈ (0[,]1))) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆)
47	46	3exp2 1355	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ 𝑆 → (𝑦 ∈ 𝑆 → (𝑡 ∈ (0[,]1) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆))))
48	47	com23 86	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑦 ∈ 𝑆 → (𝑥 ∈ 𝑆 → (𝑡 ∈ (0[,]1) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆))))
49	48	imp42 426	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) ∧ 𝑡 ∈ (0[,]1)) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆)
50	49	fmpttd 7060	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))):(0[,]1)⟶𝑆)
51	50	frnd 6670	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ran (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ⊆ 𝑆)
52		cnrest2 23230	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ ran (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ⊆ 𝑆 ∧ 𝑆 ⊆ ℂ) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn 𝐽) ↔ (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn (𝐽 ↾_t 𝑆))))
53	12, 51, 35, 52	mp3an2i 1468	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn 𝐽) ↔ (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn (𝐽 ↾_t 𝑆))))
54	45, 53	mpbid 232	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn (𝐽 ↾_t 𝑆)))
55	1	oveq2i 7369	. . . . . 6 ⊢ (II Cn 𝐾) = (II Cn (𝐽 ↾_t 𝑆))
56	54, 55	eleqtrrdi 2847	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn 𝐾))
57		0elunit 13385	. . . . . . 7 ⊢ 0 ∈ (0[,]1)
58		oveq1 7365	. . . . . . . . 9 ⊢ (𝑡 = 0 → (𝑡 · 𝑥) = (0 · 𝑥))
59		oveq2 7366	. . . . . . . . . . 11 ⊢ (𝑡 = 0 → (1 − 𝑡) = (1 − 0))
60		1m0e1 12261	. . . . . . . . . . 11 ⊢ (1 − 0) = 1
61	59, 60	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝑡 = 0 → (1 − 𝑡) = 1)
62	61	oveq1d 7373	. . . . . . . . 9 ⊢ (𝑡 = 0 → ((1 − 𝑡) · 𝑦) = (1 · 𝑦))
63	58, 62	oveq12d 7376	. . . . . . . 8 ⊢ (𝑡 = 0 → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) = ((0 · 𝑥) + (1 · 𝑦)))
64		eqid 2736	. . . . . . . 8 ⊢ (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))
65		ovex 7391	. . . . . . . 8 ⊢ ((0 · 𝑥) + (1 · 𝑦)) ∈ V
66	63, 64, 65	fvmpt 6941	. . . . . . 7 ⊢ (0 ∈ (0[,]1) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = ((0 · 𝑥) + (1 · 𝑦)))
67	57, 66	ax-mp 5	. . . . . 6 ⊢ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = ((0 · 𝑥) + (1 · 𝑦))
68	18	adantrl 716	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → 𝑥 ∈ ℂ)
69	68	mul02d 11331	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (0 · 𝑥) = 0)
70	37	mullidd 11150	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (1 · 𝑦) = 𝑦)
71	69, 70	oveq12d 7376	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((0 · 𝑥) + (1 · 𝑦)) = (0 + 𝑦))
72	37	addlidd 11334	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (0 + 𝑦) = 𝑦)
73	71, 72	eqtrd 2771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((0 · 𝑥) + (1 · 𝑦)) = 𝑦)
74	67, 73	eqtrid 2783	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = 𝑦)
75		1elunit 13386	. . . . . . 7 ⊢ 1 ∈ (0[,]1)
76		oveq1 7365	. . . . . . . . 9 ⊢ (𝑡 = 1 → (𝑡 · 𝑥) = (1 · 𝑥))
77		oveq2 7366	. . . . . . . . . . 11 ⊢ (𝑡 = 1 → (1 − 𝑡) = (1 − 1))
78		1m1e0 12217	. . . . . . . . . . 11 ⊢ (1 − 1) = 0
79	77, 78	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝑡 = 1 → (1 − 𝑡) = 0)
80	79	oveq1d 7373	. . . . . . . . 9 ⊢ (𝑡 = 1 → ((1 − 𝑡) · 𝑦) = (0 · 𝑦))
81	76, 80	oveq12d 7376	. . . . . . . 8 ⊢ (𝑡 = 1 → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) = ((1 · 𝑥) + (0 · 𝑦)))
82		ovex 7391	. . . . . . . 8 ⊢ ((1 · 𝑥) + (0 · 𝑦)) ∈ V
83	81, 64, 82	fvmpt 6941	. . . . . . 7 ⊢ (1 ∈ (0[,]1) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = ((1 · 𝑥) + (0 · 𝑦)))
84	75, 83	ax-mp 5	. . . . . 6 ⊢ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = ((1 · 𝑥) + (0 · 𝑦))
85	68	mullidd 11150	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (1 · 𝑥) = 𝑥)
86	37	mul02d 11331	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (0 · 𝑦) = 0)
87	85, 86	oveq12d 7376	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((1 · 𝑥) + (0 · 𝑦)) = (𝑥 + 0))
88	68	addridd 11333	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → (𝑥 + 0) = 𝑥)
89	87, 88	eqtrd 2771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((1 · 𝑥) + (0 · 𝑦)) = 𝑥)
90	84, 89	eqtrid 2783	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = 𝑥)
91		fveq1 6833	. . . . . . . 8 ⊢ (𝑓 = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) → (𝑓‘0) = ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0))
92	91	eqeq1d 2738	. . . . . . 7 ⊢ (𝑓 = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) → ((𝑓‘0) = 𝑦 ↔ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = 𝑦))
93		fveq1 6833	. . . . . . . 8 ⊢ (𝑓 = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) → (𝑓‘1) = ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1))
94	93	eqeq1d 2738	. . . . . . 7 ⊢ (𝑓 = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) → ((𝑓‘1) = 𝑥 ↔ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = 𝑥))
95	92, 94	anbi12d 632	. . . . . 6 ⊢ (𝑓 = (𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) → (((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥) ↔ (((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = 𝑦 ∧ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = 𝑥)))
96	95	rspcev 3576	. . . . 5 ⊢ (((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦))) ∈ (II Cn 𝐾) ∧ (((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘0) = 𝑦 ∧ ((𝑡 ∈ (0[,]1) ↦ ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)))‘1) = 𝑥)) → ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥))
97	56, 74, 90, 96	syl12anc 836	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆)) → ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥))
98	97	ralrimivva 3179	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 ∀𝑥 ∈ 𝑆 ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥))
99		resttopon 23105	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑆 ⊆ ℂ) → (𝐽 ↾_t 𝑆) ∈ (TopOn‘𝑆))
100	12, 4, 99	sylancr 587	. . . . . 6 ⊢ (𝜑 → (𝐽 ↾_t 𝑆) ∈ (TopOn‘𝑆))
101	1, 100	eqeltrid 2840	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑆))
102		toponuni 22858	. . . . 5 ⊢ (𝐾 ∈ (TopOn‘𝑆) → 𝑆 = ∪ 𝐾)
103	101, 102	syl 17	. . . 4 ⊢ (𝜑 → 𝑆 = ∪ 𝐾)
104	103	raleqdv 3296	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥) ↔ ∀𝑥 ∈ ∪ 𝐾∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥)))
105	103, 104	raleqbidv 3316	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝑆 ∀𝑥 ∈ 𝑆 ∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥) ↔ ∀𝑦 ∈ ∪ 𝐾∀𝑥 ∈ ∪ 𝐾∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥)))
106	98, 105	mpbid 232	. 2 ⊢ (𝜑 → ∀𝑦 ∈ ∪ 𝐾∀𝑥 ∈ ∪ 𝐾∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥))
107		eqid 2736	. . 3 ⊢ ∪ 𝐾 = ∪ 𝐾
108	107	ispconn 35417	. 2 ⊢ (𝐾 ∈ PConn ↔ (𝐾 ∈ Top ∧ ∀𝑦 ∈ ∪ 𝐾∀𝑥 ∈ ∪ 𝐾∃𝑓 ∈ (II Cn 𝐾)((𝑓‘0) = 𝑦 ∧ (𝑓‘1) = 𝑥)))
109	10, 106, 108	sylanbrc 583	1 ⊢ (𝜑 → 𝐾 ∈ PConn)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 Vcvv 3440 ⊆ wss 3901 ∪ cuni 4863 ↦ cmpt 5179 ran crn 5625 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 ℂcc 11024 0cc0 11026 1c1 11027 + caddc 11029 · cmul 11031 − cmin 11364 [,]cicc 13264 ↾_t crest 17340 TopOpenctopn 17341 ℂ_fldccnfld 21309 Topctop 22837 TopOnctopon 22854 Cn ccn 23168 ×_t ctx 23504 IIcii 24824 –cn→ccncf 24825 PConncpconn 35413

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-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 ax-addf 11105

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-fi 9314 df-sup 9345 df-inf 9346 df-oi 9415 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-q 12862 df-rp 12906 df-xneg 13026 df-xadd 13027 df-xmul 13028 df-icc 13268 df-fz 13424 df-fzo 13571 df-seq 13925 df-exp 13985 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-starv 17192 df-sca 17193 df-vsca 17194 df-ip 17195 df-tset 17196 df-ple 17197 df-ds 17199 df-unif 17200 df-hom 17201 df-cco 17202 df-rest 17342 df-topn 17343 df-0g 17361 df-gsum 17362 df-topgen 17363 df-pt 17364 df-prds 17367 df-xrs 17423 df-qtop 17428 df-imas 17429 df-xps 17431 df-mre 17505 df-mrc 17506 df-acs 17508 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-mulg 18998 df-cntz 19246 df-cmn 19711 df-psmet 21301 df-xmet 21302 df-met 21303 df-bl 21304 df-mopn 21305 df-cnfld 21310 df-top 22838 df-topon 22855 df-topsp 22877 df-bases 22890 df-cn 23171 df-cnp 23172 df-tx 23506 df-hmeo 23699 df-xms 24264 df-ms 24265 df-tms 24266 df-ii 24826 df-cncf 24827 df-pconn 35415

This theorem is referenced by: cvxsconn 35437

W3C validator