MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnextucn Structured version   Visualization version   GIF version

Theorem cnextucn 22328
Description: Extension by continuity. Proposition 11 of [BourbakiTop1] p. II.20. Given a topology 𝐽 on 𝑋, a subset 𝐴 dense in 𝑋, this states a condition for 𝐹 from 𝐴 to a space 𝑌 Hausdorff and complete to be extensible by continuity. (Contributed by Thierry Arnoux, 4-Dec-2017.)
Hypotheses
Ref Expression
cnextucn.x 𝑋 = (Base‘𝑉)
cnextucn.y 𝑌 = (Base‘𝑊)
cnextucn.j 𝐽 = (TopOpen‘𝑉)
cnextucn.k 𝐾 = (TopOpen‘𝑊)
cnextucn.u 𝑈 = (UnifSt‘𝑊)
cnextucn.v (𝜑𝑉 ∈ TopSp)
cnextucn.t (𝜑𝑊 ∈ TopSp)
cnextucn.w (𝜑𝑊 ∈ CUnifSp)
cnextucn.h (𝜑𝐾 ∈ Haus)
cnextucn.a (𝜑𝐴𝑋)
cnextucn.f (𝜑𝐹:𝐴𝑌)
cnextucn.c (𝜑 → ((cls‘𝐽)‘𝐴) = 𝑋)
cnextucn.l ((𝜑𝑥𝑋) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu𝑈))
Assertion
Ref Expression
cnextucn (𝜑 → ((𝐽CnExt𝐾)‘𝐹) ∈ (𝐽 Cn 𝐾))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝜑,𝑥
Allowed substitution hints:   𝑈(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)   𝑌(𝑥)

Proof of Theorem cnextucn
StepHypRef Expression
1 eqid 2760 . 2 𝐽 = 𝐽
2 eqid 2760 . 2 𝐾 = 𝐾
3 cnextucn.v . . 3 (𝜑𝑉 ∈ TopSp)
4 cnextucn.j . . . 4 𝐽 = (TopOpen‘𝑉)
54tpstop 20963 . . 3 (𝑉 ∈ TopSp → 𝐽 ∈ Top)
63, 5syl 17 . 2 (𝜑𝐽 ∈ Top)
7 cnextucn.h . 2 (𝜑𝐾 ∈ Haus)
8 cnextucn.f . . 3 (𝜑𝐹:𝐴𝑌)
9 cnextucn.t . . . . 5 (𝜑𝑊 ∈ TopSp)
10 cnextucn.y . . . . . 6 𝑌 = (Base‘𝑊)
11 cnextucn.k . . . . . 6 𝐾 = (TopOpen‘𝑊)
1210, 11tpsuni 20962 . . . . 5 (𝑊 ∈ TopSp → 𝑌 = 𝐾)
139, 12syl 17 . . . 4 (𝜑𝑌 = 𝐾)
1413feq3d 6193 . . 3 (𝜑 → (𝐹:𝐴𝑌𝐹:𝐴 𝐾))
158, 14mpbid 222 . 2 (𝜑𝐹:𝐴 𝐾)
16 cnextucn.a . . 3 (𝜑𝐴𝑋)
17 cnextucn.x . . . . 5 𝑋 = (Base‘𝑉)
1817, 4tpsuni 20962 . . . 4 (𝑉 ∈ TopSp → 𝑋 = 𝐽)
193, 18syl 17 . . 3 (𝜑𝑋 = 𝐽)
2016, 19sseqtrd 3782 . 2 (𝜑𝐴 𝐽)
21 cnextucn.c . . 3 (𝜑 → ((cls‘𝐽)‘𝐴) = 𝑋)
2221, 19eqtrd 2794 . 2 (𝜑 → ((cls‘𝐽)‘𝐴) = 𝐽)
2310, 11istps 20960 . . . . . 6 (𝑊 ∈ TopSp ↔ 𝐾 ∈ (TopOn‘𝑌))
249, 23sylib 208 . . . . 5 (𝜑𝐾 ∈ (TopOn‘𝑌))
2524adantr 472 . . . 4 ((𝜑𝑥 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
2619eleq2d 2825 . . . . . . 7 (𝜑 → (𝑥𝑋𝑥 𝐽))
2726biimpar 503 . . . . . 6 ((𝜑𝑥 𝐽) → 𝑥𝑋)
2821adantr 472 . . . . . 6 ((𝜑𝑥 𝐽) → ((cls‘𝐽)‘𝐴) = 𝑋)
2927, 28eleqtrrd 2842 . . . . 5 ((𝜑𝑥 𝐽) → 𝑥 ∈ ((cls‘𝐽)‘𝐴))
301toptopon 20944 . . . . . . . . 9 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
316, 30sylib 208 . . . . . . . 8 (𝜑𝐽 ∈ (TopOn‘ 𝐽))
32 fveq2 6353 . . . . . . . . . 10 (𝑋 = 𝐽 → (TopOn‘𝑋) = (TopOn‘ 𝐽))
3332eleq2d 2825 . . . . . . . . 9 (𝑋 = 𝐽 → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐽 ∈ (TopOn‘ 𝐽)))
3419, 33syl 17 . . . . . . . 8 (𝜑 → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐽 ∈ (TopOn‘ 𝐽)))
3531, 34mpbird 247 . . . . . . 7 (𝜑𝐽 ∈ (TopOn‘𝑋))
3635adantr 472 . . . . . 6 ((𝜑𝑥 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
3716adantr 472 . . . . . 6 ((𝜑𝑥 𝐽) → 𝐴𝑋)
38 trnei 21917 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋𝑥𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴)))
3936, 37, 27, 38syl3anc 1477 . . . . 5 ((𝜑𝑥 𝐽) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴)))
4029, 39mpbid 222 . . . 4 ((𝜑𝑥 𝐽) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴))
418adantr 472 . . . 4 ((𝜑𝑥 𝐽) → 𝐹:𝐴𝑌)
42 flfval 22015 . . . 4 ((𝐾 ∈ (TopOn‘𝑌) ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) ∧ 𝐹:𝐴𝑌) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) = (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))))
4325, 40, 41, 42syl3anc 1477 . . 3 ((𝜑𝑥 𝐽) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) = (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))))
44 cnextucn.w . . . . 5 (𝜑𝑊 ∈ CUnifSp)
4544adantr 472 . . . 4 ((𝜑𝑥 𝐽) → 𝑊 ∈ CUnifSp)
46 cnextucn.l . . . . . 6 ((𝜑𝑥𝑋) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu𝑈))
4727, 46syldan 488 . . . . 5 ((𝜑𝑥 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu𝑈))
48 cnextucn.u . . . . . 6 𝑈 = (UnifSt‘𝑊)
4948fveq2i 6356 . . . . 5 (CauFilu𝑈) = (CauFilu‘(UnifSt‘𝑊))
5047, 49syl6eleq 2849 . . . 4 ((𝜑𝑥 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘(UnifSt‘𝑊)))
51 fvex 6363 . . . . . . 7 (Base‘𝑊) ∈ V
5210, 51eqeltri 2835 . . . . . 6 𝑌 ∈ V
5352a1i 11 . . . . 5 ((𝜑𝑥 𝐽) → 𝑌 ∈ V)
54 filfbas 21873 . . . . . 6 ((((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴))
5540, 54syl 17 . . . . 5 ((𝜑𝑥 𝐽) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴))
56 fmfil 21969 . . . . 5 ((𝑌 ∈ V ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴) ∧ 𝐹:𝐴𝑌) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌))
5753, 55, 41, 56syl3anc 1477 . . . 4 ((𝜑𝑥 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌))
5810, 11cuspcvg 22326 . . . 4 ((𝑊 ∈ CUnifSp ∧ ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌)) → (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))) ≠ ∅)
5945, 50, 57, 58syl3anc 1477 . . 3 ((𝜑𝑥 𝐽) → (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))) ≠ ∅)
6043, 59eqnetrd 2999 . 2 ((𝜑𝑥 𝐽) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ≠ ∅)
61 cuspusp 22325 . . . 4 (𝑊 ∈ CUnifSp → 𝑊 ∈ UnifSp)
6244, 61syl 17 . . 3 (𝜑𝑊 ∈ UnifSp)
6311uspreg 22299 . . 3 ((𝑊 ∈ UnifSp ∧ 𝐾 ∈ Haus) → 𝐾 ∈ Reg)
6462, 7, 63syl2anc 696 . 2 (𝜑𝐾 ∈ Reg)
651, 2, 6, 7, 15, 20, 22, 60, 64cnextcn 22092 1 (𝜑 → ((𝐽CnExt𝐾)‘𝐹) ∈ (𝐽 Cn 𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1632  wcel 2139  wne 2932  Vcvv 3340  wss 3715  c0 4058  {csn 4321   cuni 4588  wf 6045  cfv 6049  (class class class)co 6814  Basecbs 16079  t crest 16303  TopOpenctopn 16304  fBascfbas 19956  Topctop 20920  TopOnctopon 20937  TopSpctps 20958  clsccl 21044  neicnei 21123   Cn ccn 21250  Hauscha 21334  Regcreg 21335  Filcfil 21870   FilMap cfm 21958   fLim cflim 21959   fLimf cflf 21960  CnExtccnext 22084  UnifStcuss 22278  UnifSpcusp 22279  CauFiluccfilu 22311  CUnifSpccusp 22322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-iin 4675  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-om 7232  df-1st 7334  df-2nd 7335  df-wrecs 7577  df-recs 7638  df-rdg 7676  df-1o 7730  df-oadd 7734  df-er 7913  df-map 8027  df-pm 8028  df-en 8124  df-fin 8127  df-fi 8484  df-rest 16305  df-topgen 16326  df-fbas 19965  df-fg 19966  df-top 20921  df-topon 20938  df-topsp 20959  df-bases 20972  df-cld 21045  df-ntr 21046  df-cls 21047  df-nei 21124  df-cn 21253  df-cnp 21254  df-haus 21341  df-reg 21342  df-tx 21587  df-fil 21871  df-fm 21963  df-flim 21964  df-flf 21965  df-cnext 22085  df-ust 22225  df-utop 22256  df-usp 22282  df-cusp 22323
This theorem is referenced by:  ucnextcn  22329
  Copyright terms: Public domain W3C validator