pconnconn - Mathbox for Mario Carneiro

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

Theorem pconnconn 35191

Description: A path-connected space is connected. (Contributed by Mario Carneiro, 11-Feb-2015.)

**Assertion**
Ref	Expression
pconnconn	⊢ (𝐽 ∈ PConn → 𝐽 ∈ Conn)

Proof of Theorem pconnconn Dummy variables 𝑎 𝑏 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-3an 1088	. . . 4 ⊢ ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅ ∧ (𝑥 ∩ 𝑦) = ∅) ↔ ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅) ∧ (𝑥 ∩ 𝑦) = ∅))
2		n0 4312	. . . . . . . 8 ⊢ (𝑥 ≠ ∅ ↔ ∃𝑎 𝑎 ∈ 𝑥)
3		n0 4312	. . . . . . . 8 ⊢ (𝑦 ≠ ∅ ↔ ∃𝑏 𝑏 ∈ 𝑦)
4	2, 3	anbi12i 628	. . . . . . 7 ⊢ ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅) ↔ (∃𝑎 𝑎 ∈ 𝑥 ∧ ∃𝑏 𝑏 ∈ 𝑦))
5		exdistrv 1955	. . . . . . 7 ⊢ (∃𝑎∃𝑏(𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ↔ (∃𝑎 𝑎 ∈ 𝑥 ∧ ∃𝑏 𝑏 ∈ 𝑦))
6	4, 5	bitr4i 278	. . . . . 6 ⊢ ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅) ↔ ∃𝑎∃𝑏(𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦))
7		simpll 766	. . . . . . . . . 10 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝐽 ∈ PConn)
8		simprll 778	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑎 ∈ 𝑥)
9		simplrl 776	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑥 ∈ 𝐽)
10		elunii 4872	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝑥 ∧ 𝑥 ∈ 𝐽) → 𝑎 ∈ ∪ 𝐽)
11	8, 9, 10	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑎 ∈ ∪ 𝐽)
12		simprlr 779	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑏 ∈ 𝑦)
13		simplrr 777	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑦 ∈ 𝐽)
14		elunii 4872	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ 𝑦 ∧ 𝑦 ∈ 𝐽) → 𝑏 ∈ ∪ 𝐽)
15	12, 13, 14	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → 𝑏 ∈ ∪ 𝐽)
16		eqid 2729	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
17	16	pconncn 35184	. . . . . . . . . 10 ⊢ ((𝐽 ∈ PConn ∧ 𝑎 ∈ ∪ 𝐽 ∧ 𝑏 ∈ ∪ 𝐽) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏))
18	7, 11, 15, 17	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏))
19		simplrr 777	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑥 ∩ 𝑦) = ∅)
20		simplrr 777	. . . . . . . . . . . . . . . 16 ⊢ (((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽) → (𝑓‘1) = 𝑏)
21	20	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑓‘1) = 𝑏)
22		iiuni 24750	. . . . . . . . . . . . . . . . 17 ⊢ (0[,]1) = ∪ II
23		iiconn 24756	. . . . . . . . . . . . . . . . . 18 ⊢ II ∈ Conn
24	23	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → II ∈ Conn)
25		simprll 778	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑓 ∈ (II Cn 𝐽))
26	9	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑥 ∈ 𝐽)
27		uncom 4117	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∪ 𝑥) = (𝑥 ∪ 𝑦)
28		simprr 772	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑥 ∪ 𝑦) = ∪ 𝐽)
29	27, 28	eqtrid 2776	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑦 ∪ 𝑥) = ∪ 𝐽)
30	13	adantr 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑦 ∈ 𝐽)
31		elssuni 4897	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ⊆ ∪ 𝐽)
32	30, 31	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑦 ⊆ ∪ 𝐽)
33		incom 4168	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∩ 𝑥) = (𝑥 ∩ 𝑦)
34	33, 19	eqtrid 2776	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑦 ∩ 𝑥) = ∅)
35		uneqdifeq 4452	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 ⊆ ∪ 𝐽 ∧ (𝑦 ∩ 𝑥) = ∅) → ((𝑦 ∪ 𝑥) = ∪ 𝐽 ↔ (∪ 𝐽 ∖ 𝑦) = 𝑥))
36	32, 34, 35	syl2anc 584	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → ((𝑦 ∪ 𝑥) = ∪ 𝐽 ↔ (∪ 𝐽 ∖ 𝑦) = 𝑥))
37	29, 36	mpbid 232	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (∪ 𝐽 ∖ 𝑦) = 𝑥)
38		pconntop 35185	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐽 ∈ PConn → 𝐽 ∈ Top)
39	38	ad3antrrr 730	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝐽 ∈ Top)
40	16	opncld 22896	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝐽) → (∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽))
41	39, 30, 40	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (∪ 𝐽 ∖ 𝑦) ∈ (Clsd‘𝐽))
42	37, 41	eqeltrrd 2829	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑥 ∈ (Clsd‘𝐽))
43		0elunit 13406	. . . . . . . . . . . . . . . . . 18 ⊢ 0 ∈ (0[,]1)
44	43	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 0 ∈ (0[,]1))
45		simplrl 776	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽) → (𝑓‘0) = 𝑎)
46	45	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑓‘0) = 𝑎)
47	8	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑎 ∈ 𝑥)
48	46, 47	eqeltrd 2828	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑓‘0) ∈ 𝑥)
49	22, 24, 25, 26, 42, 44, 48	conncn 23289	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑓:(0[,]1)⟶𝑥)
50		1elunit 13407	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ (0[,]1)
51		ffvelcdm 7035	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(0[,]1)⟶𝑥 ∧ 1 ∈ (0[,]1)) → (𝑓‘1) ∈ 𝑥)
52	49, 50, 51	sylancl 586	. . . . . . . . . . . . . . 15 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑓‘1) ∈ 𝑥)
53	21, 52	eqeltrrd 2829	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑏 ∈ 𝑥)
54	12	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → 𝑏 ∈ 𝑦)
55		inelcm 4424	. . . . . . . . . . . . . 14 ⊢ ((𝑏 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) → (𝑥 ∩ 𝑦) ≠ ∅)
56	53, 54, 55	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → (𝑥 ∩ 𝑦) ≠ ∅)
57	19, 56	pm2.21ddne 3009	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ ((𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏)) ∧ (𝑥 ∪ 𝑦) = ∪ 𝐽)) → ¬ (𝑥 ∪ 𝑦) = ∪ 𝐽)
58	57	expr 456	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ (𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏))) → ((𝑥 ∪ 𝑦) = ∪ 𝐽 → ¬ (𝑥 ∪ 𝑦) = ∪ 𝐽))
59	58	pm2.01d 190	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ (𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏))) → ¬ (𝑥 ∪ 𝑦) = ∪ 𝐽)
60	59	neqned 2932	. . . . . . . . 9 ⊢ ((((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) ∧ (𝑓 ∈ (II Cn 𝐽) ∧ ((𝑓‘0) = 𝑎 ∧ (𝑓‘1) = 𝑏))) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)
61	18, 60	rexlimddv 3140	. . . . . . . 8 ⊢ (((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) ∧ ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) ∧ (𝑥 ∩ 𝑦) = ∅)) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)
62	61	exp32 420	. . . . . . 7 ⊢ ((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) → ((𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) → ((𝑥 ∩ 𝑦) = ∅ → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)))
63	62	exlimdvv 1934	. . . . . 6 ⊢ ((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) → (∃𝑎∃𝑏(𝑎 ∈ 𝑥 ∧ 𝑏 ∈ 𝑦) → ((𝑥 ∩ 𝑦) = ∅ → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)))
64	6, 63	biimtrid 242	. . . . 5 ⊢ ((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) → ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅) → ((𝑥 ∩ 𝑦) = ∅ → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)))
65	64	impd 410	. . . 4 ⊢ ((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) → (((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅) ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽))
66	1, 65	biimtrid 242	. . 3 ⊢ ((𝐽 ∈ PConn ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐽)) → ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅ ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽))
67	66	ralrimivva 3178	. 2 ⊢ (𝐽 ∈ PConn → ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅ ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽))
68	16	toptopon 22780	. . . 4 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
69	38, 68	sylib 218	. . 3 ⊢ (𝐽 ∈ PConn → 𝐽 ∈ (TopOn‘∪ 𝐽))
70		dfconn2 23282	. . 3 ⊢ (𝐽 ∈ (TopOn‘∪ 𝐽) → (𝐽 ∈ Conn ↔ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅ ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)))
71	69, 70	syl 17	. 2 ⊢ (𝐽 ∈ PConn → (𝐽 ∈ Conn ↔ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 ((𝑥 ≠ ∅ ∧ 𝑦 ≠ ∅ ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∪ 𝑦) ≠ ∪ 𝐽)))
72	67, 71	mpbird 257	1 ⊢ (𝐽 ∈ PConn → 𝐽 ∈ Conn)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 ∖ cdif 3908 ∪ cun 3909 ∩ cin 3910 ⊆ wss 3911 ∅c0 4292 ∪ cuni 4867 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 0cc0 11044 1c1 11045 [,]cicc 13285 Topctop 22756 TopOnctopon 22773 Clsdccld 22879 Cn ccn 23087 Conncconn 23274 IIcii 24744 PConncpconn 35179

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fi 9338 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-n0 12419 df-z 12506 df-uz 12770 df-q 12884 df-rp 12928 df-xneg 13048 df-xadd 13049 df-xmul 13050 df-ioo 13286 df-ico 13288 df-icc 13289 df-seq 13943 df-exp 14003 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-rest 17361 df-topgen 17382 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235 df-mopn 21236 df-top 22757 df-topon 22774 df-bases 22809 df-cld 22882 df-cn 23090 df-conn 23275 df-ii 24746 df-pconn 35181

This theorem is referenced by: resconn 35206 iinllyconn 35214 cvmlift2lem10 35272 cvmlift3 35288

W3C validator