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

Theorem limcfval 25841
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 25835 . . . 4 lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)})
21a1i 11 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)}))
3 fvexd 6857 . . . . 5 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → (TopOpen‘ℂfld) ∈ V)
4 simplrl 777 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑓 = 𝐹)
54dmeqd 5862 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = dom 𝐹)
6 simpll1 1214 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝐹:𝐴⟶ℂ)
76fdmd 6680 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝐹 = 𝐴)
85, 7eqtrd 2772 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = 𝐴)
9 simplrr 778 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑥 = 𝐵)
109sneqd 4594 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → {𝑥} = {𝐵})
118, 10uneq12d 4123 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (dom 𝑓 ∪ {𝑥}) = (𝐴 ∪ {𝐵}))
129eqeq2d 2748 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 = 𝑥𝑧 = 𝐵))
134fveq1d 6844 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑓𝑧) = (𝐹𝑧))
1412, 13ifbieq2d 4508 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → if(𝑧 = 𝑥, 𝑦, (𝑓𝑧)) = if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
1511, 14mpteq12dv 5187 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))))
16 simpr 484 . . . . . . . . . . 11 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = (TopOpen‘ℂfld))
17 limcval.k . . . . . . . . . . 11 𝐾 = (TopOpen‘ℂfld)
1816, 17eqtr4di 2790 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = 𝐾)
1918, 11oveq12d 7386 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = (𝐾t (𝐴 ∪ {𝐵})))
20 limcval.j . . . . . . . . 9 𝐽 = (𝐾t (𝐴 ∪ {𝐵}))
2119, 20eqtr4di 2790 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = 𝐽)
2221, 18oveq12d 7386 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗) = (𝐽 CnP 𝐾))
2322, 9fveq12d 6849 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) = ((𝐽 CnP 𝐾)‘𝐵))
2415, 23eleq12d 2831 . . . . 5 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
253, 24sbcied 3786 . . . 4 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → ([(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
2625abbidv 2803 . . 3 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)} = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
27 cnex 11119 . . . . 5 ℂ ∈ V
28 elpm2r 8794 . . . . 5 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
2927, 27, 28mpanl12 703 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
30293adant3 1133 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
31 simp3 1139 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
32 eqid 2737 . . . . . 6 (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
3320, 17, 32limcvallem 25840 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝑦 ∈ ℂ))
3433abssdv 4021 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ)
3527ssex 5268 . . . 4 ({𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
3634, 35syl 17 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
372, 26, 30, 31, 36ovmpod 7520 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
3837, 34eqsstrd 3970 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) ⊆ ℂ)
3937, 38jca 511 1 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∧ (𝐹 lim 𝐵) ⊆ ℂ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  {cab 2715  Vcvv 3442  [wsbc 3742  cun 3901  wss 3903  ifcif 4481  {csn 4582  cmpt 5181  dom cdm 5632  wf 6496  cfv 6500  (class class class)co 7368  cmpo 7370  pm cpm 8776  cc 11036  t crest 17352  TopOpenctopn 17353  fldccnfld 21321   CnP ccnp 23181   lim climc 25831
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-map 8777  df-pm 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-fi 9326  df-sup 9357  df-inf 9358  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-div 11807  df-nn 12158  df-2 12220  df-3 12221  df-4 12222  df-5 12223  df-6 12224  df-7 12225  df-8 12226  df-9 12227  df-n0 12414  df-z 12501  df-dec 12620  df-uz 12764  df-q 12874  df-rp 12918  df-xneg 13038  df-xadd 13039  df-xmul 13040  df-fz 13436  df-seq 13937  df-exp 13997  df-cj 15034  df-re 15035  df-im 15036  df-sqrt 15170  df-abs 15171  df-struct 17086  df-slot 17121  df-ndx 17133  df-base 17149  df-plusg 17202  df-mulr 17203  df-starv 17204  df-tset 17208  df-ple 17209  df-ds 17211  df-unif 17212  df-rest 17354  df-topn 17355  df-topgen 17375  df-psmet 21313  df-xmet 21314  df-met 21315  df-bl 21316  df-mopn 21317  df-cnfld 21322  df-top 22850  df-topon 22867  df-topsp 22889  df-bases 22902  df-cnp 23184  df-xms 24276  df-ms 24277  df-limc 25835
This theorem is referenced by:  ellimc  25842  limccl  25844
  Copyright terms: Public domain W3C validator