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

Theorem limcfval 25806
Description: Value and set bounds on the limit operator. (Contributed by Mario Carneiro, 25-Dec-2016.)
Hypotheses
Ref Expression
limcval.j 𝐽 = (𝐾t (𝐴 ∪ {𝐵}))
limcval.k 𝐾 = (TopOpen‘ℂfld)
Assertion
Ref Expression
limcfval ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∧ (𝐹 lim 𝐵) ⊆ ℂ))
Distinct variable groups:   𝑦,𝑧,𝐴   𝑦,𝐵,𝑧   𝑦,𝐹,𝑧   𝑦,𝐾,𝑧   𝑦,𝐽
Allowed substitution hint:   𝐽(𝑧)

Proof of Theorem limcfval
Dummy variables 𝑓 𝑗 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-limc 25800 . . . 4 lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)})
21a1i 11 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)}))
3 fvexd 6843 . . . . 5 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → (TopOpen‘ℂfld) ∈ V)
4 simplrl 776 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑓 = 𝐹)
54dmeqd 5850 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = dom 𝐹)
6 simpll1 1213 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝐹:𝐴⟶ℂ)
76fdmd 6667 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝐹 = 𝐴)
85, 7eqtrd 2766 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = 𝐴)
9 simplrr 777 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑥 = 𝐵)
109sneqd 4587 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → {𝑥} = {𝐵})
118, 10uneq12d 4118 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (dom 𝑓 ∪ {𝑥}) = (𝐴 ∪ {𝐵}))
129eqeq2d 2742 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 = 𝑥𝑧 = 𝐵))
134fveq1d 6830 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑓𝑧) = (𝐹𝑧))
1412, 13ifbieq2d 4501 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → if(𝑧 = 𝑥, 𝑦, (𝑓𝑧)) = if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
1511, 14mpteq12dv 5180 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))))
16 simpr 484 . . . . . . . . . . 11 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = (TopOpen‘ℂfld))
17 limcval.k . . . . . . . . . . 11 𝐾 = (TopOpen‘ℂfld)
1816, 17eqtr4di 2784 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = 𝐾)
1918, 11oveq12d 7370 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = (𝐾t (𝐴 ∪ {𝐵})))
20 limcval.j . . . . . . . . 9 𝐽 = (𝐾t (𝐴 ∪ {𝐵}))
2119, 20eqtr4di 2784 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = 𝐽)
2221, 18oveq12d 7370 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗) = (𝐽 CnP 𝐾))
2322, 9fveq12d 6835 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) = ((𝐽 CnP 𝐾)‘𝐵))
2415, 23eleq12d 2825 . . . . 5 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
253, 24sbcied 3780 . . . 4 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → ([(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
2625abbidv 2797 . . 3 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)} = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
27 cnex 11093 . . . . 5 ℂ ∈ V
28 elpm2r 8775 . . . . 5 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
2927, 27, 28mpanl12 702 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
30293adant3 1132 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
31 simp3 1138 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
32 eqid 2731 . . . . . 6 (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
3320, 17, 32limcvallem 25805 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝑦 ∈ ℂ))
3433abssdv 4015 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ)
3527ssex 5261 . . . 4 ({𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
3634, 35syl 17 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
372, 26, 30, 31, 36ovmpod 7504 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
3837, 34eqsstrd 3964 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) ⊆ ℂ)
3937, 38jca 511 1 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∧ (𝐹 lim 𝐵) ⊆ ℂ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2111  {cab 2709  Vcvv 3436  [wsbc 3736  cun 3895  wss 3897  ifcif 4474  {csn 4575  cmpt 5174  dom cdm 5619  wf 6483  cfv 6487  (class class class)co 7352  cmpo 7354  pm cpm 8757  cc 11010  t crest 17330  TopOpenctopn 17331  fldccnfld 21297   CnP ccnp 23146   lim climc 25796
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11068  ax-resscn 11069  ax-1cn 11070  ax-icn 11071  ax-addcl 11072  ax-addrcl 11073  ax-mulcl 11074  ax-mulrcl 11075  ax-mulcom 11076  ax-addass 11077  ax-mulass 11078  ax-distr 11079  ax-i2m1 11080  ax-1ne0 11081  ax-1rid 11082  ax-rnegex 11083  ax-rrecex 11084  ax-cnre 11085  ax-pre-lttri 11086  ax-pre-lttrn 11087  ax-pre-ltadd 11088  ax-pre-mulgt0 11089  ax-pre-sup 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6254  df-ord 6315  df-on 6316  df-lim 6317  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-er 8628  df-map 8758  df-pm 8759  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-fi 9301  df-sup 9332  df-inf 9333  df-pnf 11154  df-mnf 11155  df-xr 11156  df-ltxr 11157  df-le 11158  df-sub 11352  df-neg 11353  df-div 11781  df-nn 12132  df-2 12194  df-3 12195  df-4 12196  df-5 12197  df-6 12198  df-7 12199  df-8 12200  df-9 12201  df-n0 12388  df-z 12475  df-dec 12595  df-uz 12739  df-q 12853  df-rp 12897  df-xneg 13017  df-xadd 13018  df-xmul 13019  df-fz 13414  df-seq 13915  df-exp 13975  df-cj 15012  df-re 15013  df-im 15014  df-sqrt 15148  df-abs 15149  df-struct 17064  df-slot 17099  df-ndx 17111  df-base 17127  df-plusg 17180  df-mulr 17181  df-starv 17182  df-tset 17186  df-ple 17187  df-ds 17189  df-unif 17190  df-rest 17332  df-topn 17333  df-topgen 17353  df-psmet 21289  df-xmet 21290  df-met 21291  df-bl 21292  df-mopn 21293  df-cnfld 21298  df-top 22815  df-topon 22832  df-topsp 22854  df-bases 22867  df-cnp 23149  df-xms 24241  df-ms 24242  df-limc 25800
This theorem is referenced by:  ellimc  25807  limccl  25809
  Copyright terms: Public domain W3C validator