Theorem cnconn 23309

Description: Connectedness is respected by a continuous onto map. (Contributed by Jeff Hankins, 12-Jul-2009.) (Proof shortened by Mario Carneiro, 10-Mar-2015.)

Hypothesis

Ref	Expression
cnconn.2	⊢ 𝑌 = ∪ 𝐾

Assertion

Ref	Expression
cnconn	⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Conn)

Proof of Theorem cnconn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cntop2 23128	. . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
2	1	3ad2ant3 1135	. 2 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
3		df-ne 2926	. . . . . . 7 ⊢ (𝑥 ≠ ∅ ↔ ¬ 𝑥 = ∅)
4		eqid 2729	. . . . . . . . . . . 12 ⊢ ∪ 𝐽 = ∪ 𝐽
5		simpl1 1192	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝐽 ∈ Conn)
6		simpl3 1194	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝐹 ∈ (𝐽 Cn 𝐾))
7		simprl 770	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)))
8	7	elin1d 4167	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ 𝐾)
9		cnima 23152	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
10	6, 8, 9	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (◡𝐹 “ 𝑥) ∈ 𝐽)
11		elssuni 4901	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ 𝐾 → 𝑥 ⊆ ∪ 𝐾)
12	8, 11	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ⊆ ∪ 𝐾)
13		cnconn.2	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑌 = ∪ 𝐾
14	12, 13	sseqtrrdi 3988	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ⊆ 𝑌)
15		simpl2 1193	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝐹:𝑋–onto→𝑌)
16		forn 6775	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹:𝑋–onto→𝑌 → ran 𝐹 = 𝑌)
17	15, 16	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → ran 𝐹 = 𝑌)
18	14, 17	sseqtrrd 3984	. . . . . . . . . . . . . . . 16 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ⊆ ran 𝐹)
19		df-rn 5649	. . . . . . . . . . . . . . . 16 ⊢ ran 𝐹 = dom ◡𝐹
20	18, 19	sseqtrdi 3987	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ⊆ dom ◡𝐹)
21		sseqin2 4186	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ⊆ dom ◡𝐹 ↔ (dom ◡𝐹 ∩ 𝑥) = 𝑥)
22	20, 21	sylib 218	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (dom ◡𝐹 ∩ 𝑥) = 𝑥)
23		simprr 772	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ≠ ∅)
24	22, 23	eqnetrd 2992	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (dom ◡𝐹 ∩ 𝑥) ≠ ∅)
25		imadisj 6051	. . . . . . . . . . . . . 14 ⊢ ((◡𝐹 “ 𝑥) = ∅ ↔ (dom ◡𝐹 ∩ 𝑥) = ∅)
26	25	necon3bii 2977	. . . . . . . . . . . . 13 ⊢ ((◡𝐹 “ 𝑥) ≠ ∅ ↔ (dom ◡𝐹 ∩ 𝑥) ≠ ∅)
27	24, 26	sylibr 234	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (◡𝐹 “ 𝑥) ≠ ∅)
28	7	elin2d 4168	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ (Clsd‘𝐾))
29		cnclima 23155	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝑥) ∈ (Clsd‘𝐽))
30	6, 28, 29	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (◡𝐹 “ 𝑥) ∈ (Clsd‘𝐽))
31	4, 5, 10, 27, 30	connclo 23302	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (◡𝐹 “ 𝑥) = ∪ 𝐽)
32	4, 13	cnf 23133	. . . . . . . . . . . 12 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶𝑌)
33		fdm 6697	. . . . . . . . . . . 12 ⊢ (𝐹:∪ 𝐽⟶𝑌 → dom 𝐹 = ∪ 𝐽)
34	6, 32, 33	3syl 18	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → dom 𝐹 = ∪ 𝐽)
35		fof 6772	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹:𝑋⟶𝑌)
36		fdm 6697	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋⟶𝑌 → dom 𝐹 = 𝑋)
37	15, 35, 36	3syl 18	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → dom 𝐹 = 𝑋)
38	31, 34, 37	3eqtr2d 2770	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (◡𝐹 “ 𝑥) = 𝑋)
39	38	imaeq2d 6031	. . . . . . . . 9 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (𝐹 “ (◡𝐹 “ 𝑥)) = (𝐹 “ 𝑋))
40		foimacnv 6817	. . . . . . . . . 10 ⊢ ((𝐹:𝑋–onto→𝑌 ∧ 𝑥 ⊆ 𝑌) → (𝐹 “ (◡𝐹 “ 𝑥)) = 𝑥)
41	15, 14, 40	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (𝐹 “ (◡𝐹 “ 𝑥)) = 𝑥)
42		foima 6777	. . . . . . . . . 10 ⊢ (𝐹:𝑋–onto→𝑌 → (𝐹 “ 𝑋) = 𝑌)
43	15, 42	syl 17	. . . . . . . . 9 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → (𝐹 “ 𝑋) = 𝑌)
44	39, 41, 43	3eqtr3d 2772	. . . . . . . 8 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) ∧ 𝑥 ≠ ∅)) → 𝑥 = 𝑌)
45	44	expr 456	. . . . . . 7 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾))) → (𝑥 ≠ ∅ → 𝑥 = 𝑌))
46	3, 45	biimtrrid 243	. . . . . 6 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾))) → (¬ 𝑥 = ∅ → 𝑥 = 𝑌))
47	46	orrd 863	. . . . 5 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾))) → (𝑥 = ∅ ∨ 𝑥 = 𝑌))
48		vex 3451	. . . . . 6 ⊢ 𝑥 ∈ V
49	48	elpr 4614	. . . . 5 ⊢ (𝑥 ∈ {∅, 𝑌} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝑌))
50	47, 49	sylibr 234	. . . 4 ⊢ (((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾))) → 𝑥 ∈ {∅, 𝑌})
51	50	ex 412	. . 3 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝑥 ∈ (𝐾 ∩ (Clsd‘𝐾)) → 𝑥 ∈ {∅, 𝑌}))
52	51	ssrdv 3952	. 2 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐾 ∩ (Clsd‘𝐾)) ⊆ {∅, 𝑌})
53	13	isconn2 23301	. 2 ⊢ (𝐾 ∈ Conn ↔ (𝐾 ∈ Top ∧ (𝐾 ∩ (Clsd‘𝐾)) ⊆ {∅, 𝑌}))
54	2, 52, 53	sylanbrc 583	1 ⊢ ((𝐽 ∈ Conn ∧ 𝐹:𝑋–onto→𝑌 ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Conn)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296  {cpr 4591  ∪ cuni 4871  ^◡ccnv 5637  dom cdm 5638  ran crn 5639   “ cima 5641  ⟶wf 6507  –onto→wfo 6509  ‘cfv 6511  (class class class)co 7387  Topctop 22780  Clsdccld 22903   Cn ccn 23111  Conncconn 23298

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-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  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-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-top 22781  df-topon 22798  df-cld 22906  df-cn 23114  df-conn 23299

This theorem is referenced by:  connima  23312  conncn  23313  qtopconn  23596  connhmph  23676  ivthALT  36323