Theorem cnextf 24099

Description: Extension by continuity. The extension by continuity is a function. (Contributed by Thierry Arnoux, 25-Dec-2017.)

Hypotheses

Ref	Expression
cnextf.1	⊢ 𝐶 = ∪ 𝐽
cnextf.2	⊢ 𝐵 = ∪ 𝐾
cnextf.3	⊢ (𝜑 → 𝐽 ∈ Top)
cnextf.4	⊢ (𝜑 → 𝐾 ∈ Haus)
cnextf.5	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
cnextf.a	⊢ (𝜑 → 𝐴 ⊆ 𝐶)
cnextf.6	⊢ (𝜑 → ((cls‘𝐽)‘𝐴) = 𝐶)
cnextf.7	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ≠ ∅)

Assertion

Ref	Expression
cnextf	⊢ (𝜑 → ((𝐽CnExt𝐾)‘𝐹):𝐶⟶𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝜑,𝑥

Proof of Theorem cnextf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnextf.3	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Top)
2		cnextf.4	. . . 4 ⊢ (𝜑 → 𝐾 ∈ Haus)
3		cnextf.5	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
4		cnextf.a	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐶)
5		cnextf.1	. . . . 5 ⊢ 𝐶 = ∪ 𝐽
6		cnextf.2	. . . . 5 ⊢ 𝐵 = ∪ 𝐾
7	5, 6	cnextfun 24097	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Haus) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝐶)) → Fun ((𝐽CnExt𝐾)‘𝐹))
8	1, 2, 3, 4, 7	syl22anc 847	. . 3 ⊢ (𝜑 → Fun ((𝐽CnExt𝐾)‘𝐹))
9		dfdm3 5856	. . . 4 ⊢ dom ((𝐽CnExt𝐾)‘𝐹) = {𝑥 ∣ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)}
10		simpl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝜑)
11		cnextf.6	. . . . . . . . 9 ⊢ (𝜑 → ((cls‘𝐽)‘𝐴) = 𝐶)
12	11	eleq2d 2842	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ 𝑥 ∈ 𝐶))
13	12	biimpar 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ ((cls‘𝐽)‘𝐴))
14		cnextf.7	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ≠ ∅)
15		n0 4300	. . . . . . . 8 ⊢ (((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))
16	14, 15	sylib 220	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑦 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))
17		haustop 23364	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ Haus → 𝐾 ∈ Top)
18	2, 17	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ∈ Top)
19	5, 6	cnextfval 24095	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝐶)) → ((𝐽CnExt𝐾)‘𝐹) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
20	1, 18, 3, 4, 19	syl22anc 847	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐽CnExt𝐾)‘𝐹) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
21	20	eleq2d 2842	. . . . . . . . . . 11 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹) ↔ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))))
22		opeliunxp 5707	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ↔ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
23	21, 22	bitrdi 289	. . . . . . . . . 10 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹) ↔ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))))
24	23	exbidv 1935	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹) ↔ ∃𝑦(𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))))
25		19.42v 1967	. . . . . . . . 9 ⊢ (∃𝑦(𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ↔ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ ∃𝑦 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
26	24, 25	bitrdi 289	. . . . . . . 8 ⊢ (𝜑 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹) ↔ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ ∃𝑦 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))))
27	26	biimpar 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ∧ ∃𝑦 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))) → ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹))
28	10, 13, 16, 27	syl12anc 845	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹))
29	26	simprbda 501	. . . . . . 7 ⊢ ((𝜑 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)) → 𝑥 ∈ ((cls‘𝐽)‘𝐴))
30	12	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ 𝑥 ∈ 𝐶))
31	29, 30	mpbid 234	. . . . . 6 ⊢ ((𝜑 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)) → 𝑥 ∈ 𝐶)
32	28, 31	impbida 808	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)))
33	32	eqabdv 2889	. . . 4 ⊢ (𝜑 → 𝐶 = {𝑥 ∣ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((𝐽CnExt𝐾)‘𝐹)})
34	9, 33	eqtr4id 2810	. . 3 ⊢ (𝜑 → dom ((𝐽CnExt𝐾)‘𝐹) = 𝐶)
35		df-fn 6513	. . 3 ⊢ (((𝐽CnExt𝐾)‘𝐹) Fn 𝐶 ↔ (Fun ((𝐽CnExt𝐾)‘𝐹) ∧ dom ((𝐽CnExt𝐾)‘𝐹) = 𝐶))
36	8, 34, 35	sylanbrc 591	. 2 ⊢ (𝜑 → ((𝐽CnExt𝐾)‘𝐹) Fn 𝐶)
37	20	rneqd 5907	. . 3 ⊢ (𝜑 → ran ((𝐽CnExt𝐾)‘𝐹) = ran ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
38		rniun 6122	. . . 4 ⊢ ran ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))
39		vex 3452	. . . . . . . . 9 ⊢ 𝑥 ∈ V
40	39	snnz 4729	. . . . . . . 8 ⊢ {𝑥} ≠ ∅
41		rnxp 6145	. . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) = ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))
42	40, 41	ax-mp 5	. . . . . . 7 ⊢ ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) = ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)
43	12	biimpa 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((cls‘𝐽)‘𝐴)) → 𝑥 ∈ 𝐶)
44	6	toptopon 22950	. . . . . . . . . . 11 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝐵))
45	18, 44	sylib 220	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝐵))
46	45	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐾 ∈ (TopOn‘𝐵))
47	5	toptopon 22950	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝐶))
48	1, 47	sylib 220	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝐶))
49	48	adantr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐽 ∈ (TopOn‘𝐶))
50	4	adantr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐴 ⊆ 𝐶)
51		simpr 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
52		trnei 23925	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝐶) ∧ 𝐴 ⊆ 𝐶 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴)))
53	52	biimpa 479	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝐶) ∧ 𝐴 ⊆ 𝐶 ∧ 𝑥 ∈ 𝐶) ∧ 𝑥 ∈ ((cls‘𝐽)‘𝐴)) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴))
54	49, 50, 51, 13, 53	syl31anc 1388	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴))
55	3	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐹:𝐴⟶𝐵)
56		flfelbas 24027	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ (TopOn‘𝐵) ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) → 𝑦 ∈ 𝐵)
57	56	ex 415	. . . . . . . . . 10 ⊢ ((𝐾 ∈ (TopOn‘𝐵) ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) ∧ 𝐹:𝐴⟶𝐵) → (𝑦 ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) → 𝑦 ∈ 𝐵))
58	57	ssrdv 3937	. . . . . . . . 9 ⊢ ((𝐾 ∈ (TopOn‘𝐵) ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) ∧ 𝐹:𝐴⟶𝐵) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ⊆ 𝐵)
59	46, 54, 55, 58	syl3anc 1386	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ⊆ 𝐵)
60	43, 59	syldan 599	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((cls‘𝐽)‘𝐴)) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ⊆ 𝐵)
61	42, 60	eqsstrid 3969	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ((cls‘𝐽)‘𝐴)) → ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵)
62	61	ralrimiva 3148	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ((cls‘𝐽)‘𝐴)ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵)
63		iunss 4996	. . . . 5 ⊢ (∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵 ↔ ∀𝑥 ∈ ((cls‘𝐽)‘𝐴)ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵)
64	62, 63	sylibr 236	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)ran ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵)
65	38, 64	eqsstrid 3969	. . 3 ⊢ (𝜑 → ran ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ⊆ 𝐵)
66	37, 65	eqsstrd 3965	. 2 ⊢ (𝜑 → ran ((𝐽CnExt𝐾)‘𝐹) ⊆ 𝐵)
67		df-f 6514	. 2 ⊢ (((𝐽CnExt𝐾)‘𝐹):𝐶⟶𝐵 ↔ (((𝐽CnExt𝐾)‘𝐹) Fn 𝐶 ∧ ran ((𝐽CnExt𝐾)‘𝐹) ⊆ 𝐵))
68	36, 66, 67	sylanbrc 591	1 ⊢ (𝜑 → ((𝐽CnExt𝐾)‘𝐹):𝐶⟶𝐵)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1095   = wceq 1554  ∃wex 1793   ∈ wcel 2136  {cab 2734   ≠ wne 2951  ∀wral 3070   ⊆ wss 3899  ∅c0 4280  {csn 4576  ⟨cop 4582  ∪ cuni 4859  ∪ ciun 4943   × cxp 5638  dom cdm 5640  ran crn 5641  Fun wfun 6504   Fn wfn 6505  ⟶wf 6506  ‘cfv 6510  (class class class)co 7385   ↾_t crest 17425  Topctop 22926  TopOnctopon 22943  clsccl 23051  neicnei 23130  Hauscha 23341  Filcfil 23878   fLimf cflf 23968  CnExtccnext 24092

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-rep 5221  ax-sep 5240  ax-nul 5250  ax-pow 5316  ax-pr 5384  ax-un 7707

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-nel 3056  df-ral 3071  df-rex 3081  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4900  df-iun 4945  df-iin 4946  df-br 5095  df-opab 5157  df-mpt 5176  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-ov 7388  df-oprab 7389  df-mpo 7390  df-1st 7959  df-2nd 7960  df-map 8798  df-pm 8799  df-rest 17427  df-fbas 21394  df-fg 21395  df-top 22927  df-topon 22944  df-cld 23052  df-ntr 23053  df-cls 23054  df-nei 23131  df-haus 23348  df-fil 23879  df-fm 23971  df-flim 23972  df-flf 23973  df-cnext 24093

This theorem is referenced by:  cnextcn  24100  cnextfres1  24101