| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnlimcim | GIF version | ||
| Description: If 𝐹 is a continuous function, the limit of the function at each point equals the value of the function. (Contributed by Mario Carneiro, 28-Dec-2016.) (Revised by Jim Kingdon, 16-Jun-2023.) |
| Ref | Expression |
|---|---|
| cnlimcim | ⊢ (𝐴 ⊆ ℂ → (𝐹 ∈ (𝐴–cn→ℂ) → (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3204 | . . . . 5 ⊢ ℂ ⊆ ℂ | |
| 2 | eqid 2196 | . . . . . 6 ⊢ (MetOpen‘(abs ∘ − )) = (MetOpen‘(abs ∘ − )) | |
| 3 | eqid 2196 | . . . . . 6 ⊢ ((MetOpen‘(abs ∘ − )) ↾t 𝐴) = ((MetOpen‘(abs ∘ − )) ↾t 𝐴) | |
| 4 | 2 | cntoptopon 14794 | . . . . . . 7 ⊢ (MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ) |
| 5 | 4 | toponrestid 14283 | . . . . . 6 ⊢ (MetOpen‘(abs ∘ − )) = ((MetOpen‘(abs ∘ − )) ↾t ℂ) |
| 6 | 2, 3, 5 | cncfcncntop 14855 | . . . . 5 ⊢ ((𝐴 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (𝐴–cn→ℂ) = (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − )))) |
| 7 | 1, 6 | mpan2 425 | . . . 4 ⊢ (𝐴 ⊆ ℂ → (𝐴–cn→ℂ) = (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − )))) |
| 8 | 7 | eleq2d 2266 | . . 3 ⊢ (𝐴 ⊆ ℂ → (𝐹 ∈ (𝐴–cn→ℂ) ↔ 𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − ))))) |
| 9 | resttopon 14433 | . . . . 5 ⊢ (((MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ) ∧ 𝐴 ⊆ ℂ) → ((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴)) | |
| 10 | 4, 9 | mpan 424 | . . . 4 ⊢ (𝐴 ⊆ ℂ → ((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴)) |
| 11 | cncnp 14492 | . . . 4 ⊢ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴) ∧ (MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ)) → (𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − ))) ↔ (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)))) | |
| 12 | 10, 4, 11 | sylancl 413 | . . 3 ⊢ (𝐴 ⊆ ℂ → (𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − ))) ↔ (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)))) |
| 13 | 8, 12 | bitrd 188 | . 2 ⊢ (𝐴 ⊆ ℂ → (𝐹 ∈ (𝐴–cn→ℂ) ↔ (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)))) |
| 14 | 2, 3 | cnplimcim 14929 | . . . . 5 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) → (𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥) → (𝐹:𝐴⟶ℂ ∧ (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)))) |
| 15 | simpr 110 | . . . . 5 ⊢ ((𝐹:𝐴⟶ℂ ∧ (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)) → (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)) | |
| 16 | 14, 15 | syl6 33 | . . . 4 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) → (𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥) → (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥))) |
| 17 | 16 | ralimdva 2564 | . . 3 ⊢ (𝐴 ⊆ ℂ → (∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥))) |
| 18 | 17 | anim2d 337 | . 2 ⊢ (𝐴 ⊆ ℂ → ((𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)) → (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)))) |
| 19 | 13, 18 | sylbid 150 | 1 ⊢ (𝐴 ⊆ ℂ → (𝐹 ∈ (𝐴–cn→ℂ) → (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ (𝐹 limℂ 𝑥)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2167 ∀wral 2475 ⊆ wss 3157 ∘ ccom 4668 ⟶wf 5255 ‘cfv 5259 (class class class)co 5923 ℂcc 7880 − cmin 8200 abscabs 11165 ↾t crest 12927 MetOpencmopn 14123 TopOnctopon 14272 Cn ccn 14447 CnP ccnp 14448 –cn→ccncf 14832 limℂ climc 14916 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7973 ax-resscn 7974 ax-1cn 7975 ax-1re 7976 ax-icn 7977 ax-addcl 7978 ax-addrcl 7979 ax-mulcl 7980 ax-mulrcl 7981 ax-addcom 7982 ax-mulcom 7983 ax-addass 7984 ax-mulass 7985 ax-distr 7986 ax-i2m1 7987 ax-0lt1 7988 ax-1rid 7989 ax-0id 7990 ax-rnegex 7991 ax-precex 7992 ax-cnre 7993 ax-pre-ltirr 7994 ax-pre-ltwlin 7995 ax-pre-lttrn 7996 ax-pre-apti 7997 ax-pre-ltadd 7998 ax-pre-mulgt0 7999 ax-pre-mulext 8000 ax-arch 8001 ax-caucvg 8002 |
| This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5878 df-ov 5926 df-oprab 5927 df-mpo 5928 df-1st 6200 df-2nd 6201 df-recs 6365 df-frec 6451 df-map 6711 df-pm 6712 df-sup 7052 df-inf 7053 df-pnf 8066 df-mnf 8067 df-xr 8068 df-ltxr 8069 df-le 8070 df-sub 8202 df-neg 8203 df-reap 8605 df-ap 8612 df-div 8703 df-inn 8994 df-2 9052 df-3 9053 df-4 9054 df-n0 9253 df-z 9330 df-uz 9605 df-q 9697 df-rp 9732 df-xneg 9850 df-xadd 9851 df-seqfrec 10543 df-exp 10634 df-cj 11010 df-re 11011 df-im 11012 df-rsqrt 11166 df-abs 11167 df-rest 12929 df-topgen 12948 df-psmet 14125 df-xmet 14126 df-met 14127 df-bl 14128 df-mopn 14129 df-top 14260 df-topon 14273 df-bases 14305 df-cn 14450 df-cnp 14451 df-cncf 14833 df-limced 14918 |
| This theorem is referenced by: cnlimci 14935 |
| Copyright terms: Public domain | W3C validator |