Theorem cnextfval 24091

Description: The continuous extension of a given function 𝐹. (Contributed by Thierry Arnoux, 1-Dec-2017.)

Hypotheses

Ref	Expression
cnextfval.1	⊢ 𝑋 = ∪ 𝐽
cnextfval.2	⊢ 𝐵 = ∪ 𝐾

Assertion

Ref	Expression
cnextfval	⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → ((𝐽CnExt𝐾)‘𝐹) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))

Distinct variable groups:   𝑥,𝐽   𝑥,𝐾   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝑋

Proof of Theorem cnextfval

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnextval 24090	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽CnExt𝐾) = (𝑓 ∈ (∪ 𝐾 ↑pm ∪ 𝐽) ↦ ∪ 𝑥 ∈ ((cls‘𝐽)‘dom 𝑓)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓))‘𝑓))))
2	1	adantr 483	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → (𝐽CnExt𝐾) = (𝑓 ∈ (∪ 𝐾 ↑pm ∪ 𝐽) ↦ ∪ 𝑥 ∈ ((cls‘𝐽)‘dom 𝑓)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓))‘𝑓))))
3		simpr 487	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
4	3	dmeqd 5870	. . . . 5 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → dom 𝑓 = dom 𝐹)
5		simplrl 784	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → 𝐹:𝐴⟶𝐵)
6	5	fdmd 6687	. . . . 5 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → dom 𝐹 = 𝐴)
7	4, 6	eqtrd 2787	. . . 4 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
8	7	fveq2d 6856	. . 3 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → ((cls‘𝐽)‘dom 𝑓) = ((cls‘𝐽)‘𝐴))
9	7	oveq2d 7397	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓) = (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))
10	9	oveq2d 7397	. . . . 5 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → (𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓)) = (𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴)))
11	10, 3	fveq12d 6859	. . . 4 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓))‘𝑓) = ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹))
12	11	xpeq2d 5666	. . 3 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓))‘𝑓)) = ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
13	8, 12	iuneq12d 4969	. 2 ⊢ ((((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) ∧ 𝑓 = 𝐹) → ∪ 𝑥 ∈ ((cls‘𝐽)‘dom 𝑓)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t dom 𝑓))‘𝑓)) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))
14		uniexg 7708	. . . 4 ⊢ (𝐾 ∈ Top → ∪ 𝐾 ∈ V)
15	14	ad2antlr 735	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → ∪ 𝐾 ∈ V)
16		uniexg 7708	. . . 4 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V)
17	16	ad2antrr 734	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → ∪ 𝐽 ∈ V)
18		eqid 2752	. . . . . 6 ⊢ 𝐴 = 𝐴
19		cnextfval.2	. . . . . 6 ⊢ 𝐵 = ∪ 𝐾
20	18, 19	feq23i 6670	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐴⟶∪ 𝐾)
21	20	biimpi 218	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶∪ 𝐾)
22	21	ad2antrl 736	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → 𝐹:𝐴⟶∪ 𝐾)
23		cnextfval.1	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
24	23	sseq2i 3956	. . . . 5 ⊢ (𝐴 ⊆ 𝑋 ↔ 𝐴 ⊆ ∪ 𝐽)
25	24	biimpi 218	. . . 4 ⊢ (𝐴 ⊆ 𝑋 → 𝐴 ⊆ ∪ 𝐽)
26	25	ad2antll 737	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → 𝐴 ⊆ ∪ 𝐽)
27		elpm2r 8811	. . 3 ⊢ (((∪ 𝐾 ∈ V ∧ ∪ 𝐽 ∈ V) ∧ (𝐹:𝐴⟶∪ 𝐾 ∧ 𝐴 ⊆ ∪ 𝐽)) → 𝐹 ∈ (∪ 𝐾 ↑pm ∪ 𝐽))
28	15, 17, 22, 26, 27	syl22anc 847	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → 𝐹 ∈ (∪ 𝐾 ↑pm ∪ 𝐽))
29		fvex 6865	. . . 4 ⊢ ((cls‘𝐽)‘𝐴) ∈ V
30		vsnex 5382	. . . . 5 ⊢ {𝑥} ∈ V
31		fvex 6865	. . . . 5 ⊢ ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ∈ V
32	30, 31	xpex 7721	. . . 4 ⊢ ({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ∈ V
33	29, 32	iunex 7934	. . 3 ⊢ ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ∈ V
34	33	a1i 11	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)) ∈ V)
35	2, 13, 28, 34	fvmptd 6968	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐴 ⊆ 𝑋)) → ((𝐽CnExt𝐾)‘𝐹) = ∪ 𝑥 ∈ ((cls‘𝐽)‘𝐴)({𝑥} × ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹)))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1550   ∈ wcel 2132  Vcvv 3444   ⊆ wss 3895  {csn 4572  ∪ cuni 4855  ∪ ciun 4939   ↦ cmpt 5171   × cxp 5634  dom cdm 5636  ⟶wf 6502  ‘cfv 6506  (class class class)co 7381   ↑_pm cpm 8793   ↾_t crest 17421  Topctop 22922  clsccl 23047  neicnei 23126   fLimf cflf 23964  CnExtccnext 24088

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-ov 7384  df-oprab 7385  df-mpo 7386  df-pm 8795  df-cnext 24089

This theorem is referenced by:  cnextrel  24092  cnextfun  24093  cnextfvval  24094  cnextf  24095  cnextfres  24098