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

Theorem limcfval 24723
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 24717 . . . 4 lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)})
21a1i 11 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → lim = (𝑓 ∈ (ℂ ↑pm ℂ), 𝑥 ∈ ℂ ↦ {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)}))
3 fvexd 6710 . . . . 5 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → (TopOpen‘ℂfld) ∈ V)
4 simplrl 777 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑓 = 𝐹)
54dmeqd 5759 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = dom 𝐹)
6 simpll1 1214 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝐹:𝐴⟶ℂ)
76fdmd 6534 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝐹 = 𝐴)
85, 7eqtrd 2771 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → dom 𝑓 = 𝐴)
9 simplrr 778 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑥 = 𝐵)
109sneqd 4539 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → {𝑥} = {𝐵})
118, 10uneq12d 4064 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (dom 𝑓 ∪ {𝑥}) = (𝐴 ∪ {𝐵}))
129eqeq2d 2747 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 = 𝑥𝑧 = 𝐵))
134fveq1d 6697 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑓𝑧) = (𝐹𝑧))
1412, 13ifbieq2d 4451 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → if(𝑧 = 𝑥, 𝑦, (𝑓𝑧)) = if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
1511, 14mpteq12dv 5125 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))))
16 simpr 488 . . . . . . . . . . 11 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = (TopOpen‘ℂfld))
17 limcval.k . . . . . . . . . . 11 𝐾 = (TopOpen‘ℂfld)
1816, 17eqtr4di 2789 . . . . . . . . . 10 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → 𝑗 = 𝐾)
1918, 11oveq12d 7209 . . . . . . . . 9 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = (𝐾t (𝐴 ∪ {𝐵})))
20 limcval.j . . . . . . . . 9 𝐽 = (𝐾t (𝐴 ∪ {𝐵}))
2119, 20eqtr4di 2789 . . . . . . . 8 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (𝑗t (dom 𝑓 ∪ {𝑥})) = 𝐽)
2221, 18oveq12d 7209 . . . . . . 7 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗) = (𝐽 CnP 𝐾))
2322, 9fveq12d 6702 . . . . . 6 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) = ((𝐽 CnP 𝐾)‘𝐵))
2415, 23eleq12d 2825 . . . . 5 ((((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) ∧ 𝑗 = (TopOpen‘ℂfld)) → ((𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
253, 24sbcied 3728 . . . 4 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → ([(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥) ↔ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)))
2625abbidv 2800 . . 3 (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝑓 = 𝐹𝑥 = 𝐵)) → {𝑦[(TopOpen‘ℂfld) / 𝑗](𝑧 ∈ (dom 𝑓 ∪ {𝑥}) ↦ if(𝑧 = 𝑥, 𝑦, (𝑓𝑧))) ∈ (((𝑗t (dom 𝑓 ∪ {𝑥})) CnP 𝑗)‘𝑥)} = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
27 cnex 10775 . . . . 5 ℂ ∈ V
28 elpm2r 8504 . . . . 5 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
2927, 27, 28mpanl12 702 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
30293adant3 1134 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
31 simp3 1140 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
32 eqid 2736 . . . . . 6 (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) = (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧)))
3320, 17, 32limcvallem 24722 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵) → 𝑦 ∈ ℂ))
3433abssdv 3968 . . . 4 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ)
3527ssex 5199 . . . 4 ({𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ⊆ ℂ → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
3634, 35syl 17 . . 3 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∈ V)
372, 26, 30, 31, 36ovmpod 7339 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)})
3837, 34eqsstrd 3925 . 2 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹 lim 𝐵) ⊆ ℂ)
3937, 38jca 515 1 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 lim 𝐵) = {𝑦 ∣ (𝑧 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑧 = 𝐵, 𝑦, (𝐹𝑧))) ∈ ((𝐽 CnP 𝐾)‘𝐵)} ∧ (𝐹 lim 𝐵) ⊆ ℂ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2112  {cab 2714  Vcvv 3398  [wsbc 3683  cun 3851  wss 3853  ifcif 4425  {csn 4527  cmpt 5120  dom cdm 5536  wf 6354  cfv 6358  (class class class)co 7191  cmpo 7193  pm cpm 8487  cc 10692  t crest 16879  TopOpenctopn 16880  fldccnfld 20317   CnP ccnp 22076   lim climc 24713
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501  ax-cnex 10750  ax-resscn 10751  ax-1cn 10752  ax-icn 10753  ax-addcl 10754  ax-addrcl 10755  ax-mulcl 10756  ax-mulrcl 10757  ax-mulcom 10758  ax-addass 10759  ax-mulass 10760  ax-distr 10761  ax-i2m1 10762  ax-1ne0 10763  ax-1rid 10764  ax-rnegex 10765  ax-rrecex 10766  ax-cnre 10767  ax-pre-lttri 10768  ax-pre-lttrn 10769  ax-pre-ltadd 10770  ax-pre-mulgt0 10771  ax-pre-sup 10772
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-nel 3037  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-tp 4532  df-op 4534  df-uni 4806  df-int 4846  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-tr 5147  df-id 5440  df-eprel 5445  df-po 5453  df-so 5454  df-fr 5494  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6140  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7148  df-ov 7194  df-oprab 7195  df-mpo 7196  df-om 7623  df-1st 7739  df-2nd 7740  df-wrecs 8025  df-recs 8086  df-rdg 8124  df-1o 8180  df-er 8369  df-map 8488  df-pm 8489  df-en 8605  df-dom 8606  df-sdom 8607  df-fin 8608  df-fi 9005  df-sup 9036  df-inf 9037  df-pnf 10834  df-mnf 10835  df-xr 10836  df-ltxr 10837  df-le 10838  df-sub 11029  df-neg 11030  df-div 11455  df-nn 11796  df-2 11858  df-3 11859  df-4 11860  df-5 11861  df-6 11862  df-7 11863  df-8 11864  df-9 11865  df-n0 12056  df-z 12142  df-dec 12259  df-uz 12404  df-q 12510  df-rp 12552  df-xneg 12669  df-xadd 12670  df-xmul 12671  df-fz 13061  df-seq 13540  df-exp 13601  df-cj 14627  df-re 14628  df-im 14629  df-sqrt 14763  df-abs 14764  df-struct 16668  df-ndx 16669  df-slot 16670  df-base 16672  df-plusg 16762  df-mulr 16763  df-starv 16764  df-tset 16768  df-ple 16769  df-ds 16771  df-unif 16772  df-rest 16881  df-topn 16882  df-topgen 16902  df-psmet 20309  df-xmet 20310  df-met 20311  df-bl 20312  df-mopn 20313  df-cnfld 20318  df-top 21745  df-topon 21762  df-topsp 21784  df-bases 21797  df-cnp 22079  df-xms 23172  df-ms 23173  df-limc 24717
This theorem is referenced by:  ellimc  24724  limccl  24726
  Copyright terms: Public domain W3C validator