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

Theorem flfcntr 22567
Description: A continuous function's value is always in the trace of its filter limit. (Contributed by Thierry Arnoux, 30-Aug-2020.)
Hypotheses
Ref Expression
flfcntr.c 𝐶 = 𝐽
flfcntr.b 𝐵 = 𝐾
flfcntr.j (𝜑𝐽 ∈ Top)
flfcntr.a (𝜑𝐴𝐶)
flfcntr.1 (𝜑𝐹 ∈ ((𝐽t 𝐴) Cn 𝐾))
flfcntr.y (𝜑𝑋𝐴)
Assertion
Ref Expression
flfcntr (𝜑 → (𝐹𝑋) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹))

Proof of Theorem flfcntr
Dummy variables 𝑎 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6667 . . 3 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
21eleq1d 2902 . 2 (𝑥 = 𝑋 → ((𝐹𝑥) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹) ↔ (𝐹𝑋) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹)))
3 oveq2 7156 . . . 4 (𝑎 = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) → ((𝐽t 𝐴) fLim 𝑎) = ((𝐽t 𝐴) fLim (((nei‘𝐽)‘{𝑋}) ↾t 𝐴)))
4 oveq2 7156 . . . . . 6 (𝑎 = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) → (𝐾 fLimf 𝑎) = (𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴)))
54fveq1d 6669 . . . . 5 (𝑎 = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) → ((𝐾 fLimf 𝑎)‘𝐹) = ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹))
65eleq2d 2903 . . . 4 (𝑎 = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) → ((𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹) ↔ (𝐹𝑥) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹)))
73, 6raleqbidv 3407 . . 3 (𝑎 = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) → (∀𝑥 ∈ ((𝐽t 𝐴) fLim 𝑎)(𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹) ↔ ∀𝑥 ∈ ((𝐽t 𝐴) fLim (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))(𝐹𝑥) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹)))
8 flfcntr.1 . . . . 5 (𝜑𝐹 ∈ ((𝐽t 𝐴) Cn 𝐾))
9 flfcntr.j . . . . . . . 8 (𝜑𝐽 ∈ Top)
10 flfcntr.c . . . . . . . . 9 𝐶 = 𝐽
1110toptopon 21441 . . . . . . . 8 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝐶))
129, 11sylib 219 . . . . . . 7 (𝜑𝐽 ∈ (TopOn‘𝐶))
13 flfcntr.a . . . . . . 7 (𝜑𝐴𝐶)
14 resttopon 21685 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝐶) ∧ 𝐴𝐶) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
1512, 13, 14syl2anc 584 . . . . . 6 (𝜑 → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
16 cntop2 21765 . . . . . . . 8 (𝐹 ∈ ((𝐽t 𝐴) Cn 𝐾) → 𝐾 ∈ Top)
178, 16syl 17 . . . . . . 7 (𝜑𝐾 ∈ Top)
18 flfcntr.b . . . . . . . 8 𝐵 = 𝐾
1918toptopon 21441 . . . . . . 7 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝐵))
2017, 19sylib 219 . . . . . 6 (𝜑𝐾 ∈ (TopOn‘𝐵))
21 cnflf 22526 . . . . . 6 (((𝐽t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘𝐵)) → (𝐹 ∈ ((𝐽t 𝐴) Cn 𝐾) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑎 ∈ (Fil‘𝐴)∀𝑥 ∈ ((𝐽t 𝐴) fLim 𝑎)(𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹))))
2215, 20, 21syl2anc 584 . . . . 5 (𝜑 → (𝐹 ∈ ((𝐽t 𝐴) Cn 𝐾) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑎 ∈ (Fil‘𝐴)∀𝑥 ∈ ((𝐽t 𝐴) fLim 𝑎)(𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹))))
238, 22mpbid 233 . . . 4 (𝜑 → (𝐹:𝐴𝐵 ∧ ∀𝑎 ∈ (Fil‘𝐴)∀𝑥 ∈ ((𝐽t 𝐴) fLim 𝑎)(𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹)))
2423simprd 496 . . 3 (𝜑 → ∀𝑎 ∈ (Fil‘𝐴)∀𝑥 ∈ ((𝐽t 𝐴) fLim 𝑎)(𝐹𝑥) ∈ ((𝐾 fLimf 𝑎)‘𝐹))
2510sscls 21580 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝐶) → 𝐴 ⊆ ((cls‘𝐽)‘𝐴))
269, 13, 25syl2anc 584 . . . . 5 (𝜑𝐴 ⊆ ((cls‘𝐽)‘𝐴))
27 flfcntr.y . . . . 5 (𝜑𝑋𝐴)
2826, 27sseldd 3972 . . . 4 (𝜑𝑋 ∈ ((cls‘𝐽)‘𝐴))
2913, 27sseldd 3972 . . . . 5 (𝜑𝑋𝐶)
30 trnei 22416 . . . . 5 ((𝐽 ∈ (TopOn‘𝐶) ∧ 𝐴𝐶𝑋𝐶) → (𝑋 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) ∈ (Fil‘𝐴)))
3112, 13, 29, 30syl3anc 1365 . . . 4 (𝜑 → (𝑋 ∈ ((cls‘𝐽)‘𝐴) ↔ (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) ∈ (Fil‘𝐴)))
3228, 31mpbid 233 . . 3 (𝜑 → (((nei‘𝐽)‘{𝑋}) ↾t 𝐴) ∈ (Fil‘𝐴))
337, 24, 32rspcdva 3629 . 2 (𝜑 → ∀𝑥 ∈ ((𝐽t 𝐴) fLim (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))(𝐹𝑥) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹))
34 neiflim 22498 . . . 4 (((𝐽t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝑋𝐴) → 𝑋 ∈ ((𝐽t 𝐴) fLim ((nei‘(𝐽t 𝐴))‘{𝑋})))
3515, 27, 34syl2anc 584 . . 3 (𝜑𝑋 ∈ ((𝐽t 𝐴) fLim ((nei‘(𝐽t 𝐴))‘{𝑋})))
3627snssd 4741 . . . . 5 (𝜑 → {𝑋} ⊆ 𝐴)
3710neitr 21704 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝐶 ∧ {𝑋} ⊆ 𝐴) → ((nei‘(𝐽t 𝐴))‘{𝑋}) = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))
389, 13, 36, 37syl3anc 1365 . . . 4 (𝜑 → ((nei‘(𝐽t 𝐴))‘{𝑋}) = (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))
3938oveq2d 7164 . . 3 (𝜑 → ((𝐽t 𝐴) fLim ((nei‘(𝐽t 𝐴))‘{𝑋})) = ((𝐽t 𝐴) fLim (((nei‘𝐽)‘{𝑋}) ↾t 𝐴)))
4035, 39eleqtrd 2920 . 2 (𝜑𝑋 ∈ ((𝐽t 𝐴) fLim (((nei‘𝐽)‘{𝑋}) ↾t 𝐴)))
412, 33, 40rspcdva 3629 1 (𝜑 → (𝐹𝑋) ∈ ((𝐾 fLimf (((nei‘𝐽)‘{𝑋}) ↾t 𝐴))‘𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1530  wcel 2107  wral 3143  wss 3940  {csn 4564   cuni 4837  wf 6348  cfv 6352  (class class class)co 7148  t crest 16684  Topctop 21417  TopOnctopon 21434  clsccl 21542  neicnei 21621   Cn ccn 21748  Filcfil 22369   fLim cflim 22458   fLimf cflf 22459
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7451
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-nel 3129  df-ral 3148  df-rex 3149  df-reu 3150  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-pss 3958  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-tp 4569  df-op 4571  df-uni 4838  df-int 4875  df-iun 4919  df-iin 4920  df-br 5064  df-opab 5126  df-mpt 5144  df-tr 5170  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6146  df-ord 6192  df-on 6193  df-lim 6194  df-suc 6195  df-iota 6312  df-fun 6354  df-fn 6355  df-f 6356  df-f1 6357  df-fo 6358  df-f1o 6359  df-fv 6360  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7569  df-1st 7680  df-2nd 7681  df-wrecs 7938  df-recs 7999  df-rdg 8037  df-oadd 8097  df-er 8279  df-map 8398  df-en 8499  df-fin 8502  df-fi 8864  df-rest 16686  df-topgen 16707  df-fbas 20458  df-fg 20459  df-top 21418  df-topon 21435  df-bases 21470  df-cld 21543  df-ntr 21544  df-cls 21545  df-nei 21622  df-cn 21751  df-cnp 21752  df-fil 22370  df-fm 22462  df-flim 22463  df-flf 22464
This theorem is referenced by:  cnextfres  22593
  Copyright terms: Public domain W3C validator