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

Theorem limcfval 25780
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 25774 . . . 4 lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)})
21a1i 11 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)}))
3 fvexd 6876 . . . . 5 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → (TopOpen‘ℂfld) ∈ V)
4 simplrl 776 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑓 = 𝐹)
54dmeqd 5872 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = dom 𝐹)
6 simpll1 1213 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝐹:𝐴⟶ℂ)
76fdmd 6701 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝐹 = 𝐴)
85, 7eqtrd 2765 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = 𝐴)
9 simplrr 777 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑥 = 𝐵)
109sneqd 4604 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → {𝑥} = {𝐵})
118, 10uneq12d 4135 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (dom 𝑓 ∪ {𝑥}) = (𝐴 ∪ {𝐵}))
129eqeq2d 2741 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 = 𝑥𝑧 = 𝐵))
134fveq1d 6863 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑓𝑧) = (𝐹𝑧))
1412, 13ifbieq2d 4518 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → if(𝑧 = 𝑥, 𝑦, (𝑓𝑧)) = if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
1511, 14mpteq12dv 5197 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))))
16 simpr 484 . . . . . . . . . . 11 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = (TopOpen‘ℂfld))
17 limcval.k . . . . . . . . . . 11 𝐾 = (TopOpen‘ℂfld)
1816, 17eqtr4di 2783 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = 𝐾)
1918, 11oveq12d 7408 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = (𝐾t (𝐴 ∪ {𝐵})))
20 limcval.j . . . . . . . . 9 𝐽 = (𝐾t (𝐴 ∪ {𝐵}))
2119, 20eqtr4di 2783 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = 𝐽)
2221, 18oveq12d 7408 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗) = (𝐽 CnP 𝐾))
2322, 9fveq12d 6868 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) = ((𝐽 CnP 𝐾)‘𝐵))
2415, 23eleq12d 2823 . . . . 5 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
253, 24sbcied 3800 . . . 4 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → ([(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
2625abbidv 2796 . . 3 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)} = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
27 cnex 11156 . . . . 5 ℂ ∈ V
28 elpm2r 8821 . . . . 5 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
2927, 27, 28mpanl12 702 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
30293adant3 1132 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
31 simp3 1138 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
32 eqid 2730 . . . . . 6 (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
3320, 17, 32limcvallem 25779 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝑦 ∈ ℂ))
3433abssdv 4034 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ)
3527ssex 5279 . . . 4 ({𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
3634, 35syl 17 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
372, 26, 30, 31, 36ovmpod 7544 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
3837, 34eqsstrd 3984 . 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 1540  wcel 2109  {cab 2708  Vcvv 3450  [wsbc 3756  cun 3915  wss 3917  ifcif 4491  {csn 4592  cmpt 5191  dom cdm 5641  wf 6510  cfv 6514  (class class class)co 7390  cmpo 7392  pm cpm 8803  cc 11073  t crest 17390  TopOpenctopn 17391  fldccnfld 21271   CnP ccnp 23119   lim climc 25770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152  ax-pre-sup 11153
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-tp 4597  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-1o 8437  df-er 8674  df-map 8804  df-pm 8805  df-en 8922  df-dom 8923  df-sdom 8924  df-fin 8925  df-fi 9369  df-sup 9400  df-inf 9401  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-div 11843  df-nn 12194  df-2 12256  df-3 12257  df-4 12258  df-5 12259  df-6 12260  df-7 12261  df-8 12262  df-9 12263  df-n0 12450  df-z 12537  df-dec 12657  df-uz 12801  df-q 12915  df-rp 12959  df-xneg 13079  df-xadd 13080  df-xmul 13081  df-fz 13476  df-seq 13974  df-exp 14034  df-cj 15072  df-re 15073  df-im 15074  df-sqrt 15208  df-abs 15209  df-struct 17124  df-slot 17159  df-ndx 17171  df-base 17187  df-plusg 17240  df-mulr 17241  df-starv 17242  df-tset 17246  df-ple 17247  df-ds 17249  df-unif 17250  df-rest 17392  df-topn 17393  df-topgen 17413  df-psmet 21263  df-xmet 21264  df-met 21265  df-bl 21266  df-mopn 21267  df-cnfld 21272  df-top 22788  df-topon 22805  df-topsp 22827  df-bases 22840  df-cnp 23122  df-xms 24215  df-ms 24216  df-limc 25774
This theorem is referenced by:  ellimc  25781  limccl  25783
  Copyright terms: Public domain W3C validator