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

Theorem cnextucn 24678
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 2766 . 2 ∪ 𝐽 = ∪ 𝐽
2 eqid 2766 . 2 ∪ 𝐾 = ∪ 𝐾
3 cnextucn.v . . 3 (𝜑 → 𝑉 ∈ TopSp)
4 cnextucn.j . . . 4 𝐽 = (TopOpen‘𝑉)
54tpstop 23312 . . 3 (𝑉 ∈ TopSp → 𝐽 ∈ Top)
63, 5syl 18 . 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 23311 . . . . 5 (𝑊 ∈ TopSp → 𝑌 = ∪ 𝐾)
139, 12syl 18 . . . 4 (𝜑 → 𝑌 = ∪ 𝐾)
1413feq3d 6723 . . 3 (𝜑 → (𝐹:𝐴⟶𝑌 ↔ 𝐹:𝐴⟶∪ 𝐾))
158, 14mpbid 235 . 2 (𝜑 → 𝐹:𝐴⟶∪ 𝐾)
16 cnextucn.a . . 3 (𝜑 → 𝐴 ⊆ 𝑋)
17 cnextucn.x . . . . 5 𝑋 = (Base‘𝑉)
1817, 4tpsuni 23311 . . . 4 (𝑉 ∈ TopSp → 𝑋 = ∪ 𝐽)
193, 18syl 18 . . 3 (𝜑 → 𝑋 = ∪ 𝐽)
2016, 19sseqtrd 3948 . 2 (𝜑 → 𝐴 ⊆ ∪ 𝐽)
21 cnextucn.c . . 3 (𝜑 → ((cls‘𝐽)‘𝐴) = 𝑋)
2221, 19eqtrd 2801 . 2 (𝜑 → ((cls‘𝐽)‘𝐴) = ∪ 𝐽)
2310, 11istps 23309 . . . . . 6 (𝑊 ∈ TopSp ↔ 𝐾 ∈ (TopOn‘𝑌))
249, 23sylib 221 . . . . 5 (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
2524adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝐾 ∈ (TopOn‘𝑌))
2619eleq2d 2853 . . . . . . 7 (𝜑 → (𝑥 ∈ 𝑋 ↔ 𝑥 ∈ ∪ 𝐽))
2726biimpar 483 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝑥 ∈ 𝑋)
2821adantr 486 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((cls‘𝐽)‘𝐴) = 𝑋)
2927, 28eleqtrrd 2870 . . . . 5 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝑥 ∈ ((cls‘𝐽)‘𝐴))
30 toptopon2 23293 . . . . . . . . 9 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
316, 30sylib 221 . . . . . . . 8 (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
32 fveq2 6915 . . . . . . . . . 10 (𝑋 = ∪ 𝐽 → (TopOn‘𝑋) = (TopOn‘∪ 𝐽))
3332eleq2d 2853 . . . . . . . . 9 (𝑋 = ∪ 𝐽 → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐽 ∈ (TopOn‘∪ 𝐽)))
3419, 33syl 18 . . . . . . . 8 (𝜑 → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐽 ∈ (TopOn‘∪ 𝐽)))
3531, 34mpbird 260 . . . . . . 7 (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
3635adantr 486 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ (TopOn‘𝑋))
3716adantr 486 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝐴 ⊆ 𝑋)
38 trnei 24268 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴)))
3936, 37, 27, 38syl3anc 1401 . . . . 5 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴)))
4029, 39mpbid 235 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴))
418adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝐹:𝐴⟶𝑌)
42 flfval 24366 . . . 4 ((𝐾 ∈ (TopOn‘𝑌) ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) ∧ 𝐹:𝐴⟶𝑌) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) = (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))))
4325, 40, 41, 42syl3anc 1401 . . 3 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) = (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))))
44 cnextucn.w . . . . 5 (𝜑 → 𝑊 ∈ CUnifSp)
4544adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → 𝑊 ∈ CUnifSp)
46 cnextucn.l . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘𝑈))
4727, 46syldan 603 . . . . 5 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘𝑈))
48 cnextucn.u . . . . . 6 𝑈 = (UnifSt‘𝑊)
4948fveq2i 6918 . . . . 5 (CauFilu‘𝑈) = (CauFilu‘(UnifSt‘𝑊))
5047, 49eleqtrdi 2877 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘(UnifSt‘𝑊)))
5110fvexi 6929 . . . . 5 𝑌 ∈ V
52 filfbas 24224 . . . . . 6 ((((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (Fil‘𝐴) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴))
5340, 52syl 18 . . . . 5 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴))
54 fmfil 24320 . . . . 5 ((𝑌 ∈ V ∧ (((nei‘𝐽)‘{𝑥}) ↾t 𝐴) ∈ (fBas‘𝐴) ∧ 𝐹:𝐴⟶𝑌) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌))
5551, 53, 41, 54mp3an2i 1498 . . . 4 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌))
5610, 11cuspcvg 24676 . . . 4 ((𝑊 ∈ CUnifSp ∧ ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴)) ∈ (Fil‘𝑌)) → (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))) ≠ ∅)
5745, 50, 55, 56syl3anc 1401 . . 3 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → (𝐾 fLim ((𝑌 FilMap 𝐹)‘(((nei‘𝐽)‘{𝑥}) ↾t 𝐴))) ≠ ∅)
5843, 57eqnetrd 3029 . 2 ((𝜑 ∧ 𝑥 ∈ ∪ 𝐽) → ((𝐾 fLimf (((nei‘𝐽)‘{𝑥}) ↾t 𝐴))‘𝐹) ≠ ∅)
59 cuspusp 24675 . . . 4 (𝑊 ∈ CUnifSp → 𝑊 ∈ UnifSp)
6044, 59syl 18 . . 3 (𝜑 → 𝑊 ∈ UnifSp)
6111uspreg 24649 . . 3 ((𝑊 ∈ UnifSp ∧ 𝐾 ∈ Haus) → 𝐾 ∈ Reg)
6260, 7, 61syl2anc 596 . 2 (𝜑 → 𝐾 ∈ Reg)
631, 2, 6, 7, 15, 20, 22, 58, 62cnextcn 24443 1 (𝜑 → ((𝐽CnExt𝐾)‘𝐹) ∈ (𝐽 Cn 𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  {csn 4587  ∪ cuni 4871  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450  Basecbs 17433   ↾t crest 17643  TopOpenctopn 17644  fBascfbas 21719  Topctop 23268  TopOnctopon 23285  TopSpctps 23307  clsccl 23393  neicnei 23472   Cn ccn 23599  Hauscha 23683  Regcreg 23684  Filcfil 24221   FilMap cfm 24309   fLim cflim 24310   fLimf cflf 24311  CnExtccnext 24435  UnifStcuss 24629  UnifSpcusp 24630  CauFiluccfilu 24661  CUnifSpccusp 24672
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-1o 8513  df-2o 8514  df-map 8886  df-pm 8887  df-en 9011  df-fin 9014  df-fi 9439  df-rest 17645  df-topgen 17666  df-fbas 21728  df-fg 21729  df-top 23269  df-topon 23286  df-topsp 23308  df-bases 23321  df-cld 23394  df-ntr 23395  df-cls 23396  df-nei 23473  df-cn 23602  df-cnp 23603  df-haus 23690  df-reg 23691  df-tx 23938  df-fil 24222  df-fm 24314  df-flim 24315  df-flf 24316  df-cnext 24436  df-ust 24577  df-utop 24607  df-usp 24633  df-cusp 24673
This theorem is used by:  ucnextcn  24679
  Copyright terms: Public domain W3C validator