| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ulmuni | Structured version Visualization version GIF version | ||
| Description: A sequence of functions uniformly converges to at most one limit. (Contributed by Mario Carneiro, 5-Jul-2017.) |
| Ref | Expression |
|---|---|
| ulmuni | ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺 = 𝐻) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ulmcl 26502 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ) | |
| 2 | 1 | adantr 485 | . . 3 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺:𝑆⟶ℂ) |
| 3 | 2 | ffnd 6696 | . 2 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺 Fn 𝑆) |
| 4 | ulmcl 26502 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐻 → 𝐻:𝑆⟶ℂ) | |
| 5 | 4 | adantl 486 | . . 3 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐻:𝑆⟶ℂ) |
| 6 | 5 | ffnd 6696 | . 2 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐻 Fn 𝑆) |
| 7 | eqid 2765 | . . . . 5 ⊢ (ℤ≥‘𝑛) = (ℤ≥‘𝑛) | |
| 8 | simplr 780 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝑛 ∈ ℤ) | |
| 9 | simpr 489 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) | |
| 10 | simpllr 787 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝑥 ∈ 𝑆) | |
| 11 | fvex 6884 | . . . . . . 7 ⊢ (ℤ≥‘𝑛) ∈ V | |
| 12 | 11 | mptex 7211 | . . . . . 6 ⊢ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ∈ V |
| 13 | 12 | a1i 11 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ∈ V) |
| 14 | fveq2 6871 | . . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (𝐹‘𝑖) = (𝐹‘𝑘)) | |
| 15 | 14 | fveq1d 6873 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → ((𝐹‘𝑖)‘𝑥) = ((𝐹‘𝑘)‘𝑥)) |
| 16 | eqid 2765 | . . . . . . . 8 ⊢ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) = (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) | |
| 17 | fvex 6884 | . . . . . . . 8 ⊢ ((𝐹‘𝑘)‘𝑥) ∈ V | |
| 18 | 15, 16, 17 | fvmpt 6979 | . . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑛) → ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘) = ((𝐹‘𝑘)‘𝑥)) |
| 19 | 18 | eqcomd 2771 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑛) → ((𝐹‘𝑘)‘𝑥) = ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘)) |
| 20 | 19 | adantl 486 | . . . . 5 ⊢ ((((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) ∧ 𝑘 ∈ (ℤ≥‘𝑛)) → ((𝐹‘𝑘)‘𝑥) = ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘)) |
| 21 | simp-4l 794 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹(⇝𝑢‘𝑆)𝐺) | |
| 22 | 7, 8, 9, 10, 13, 20, 21 | ulmclm 26508 | . . . 4 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐺‘𝑥)) |
| 23 | simp-4r 795 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹(⇝𝑢‘𝑆)𝐻) | |
| 24 | 7, 8, 9, 10, 13, 20, 23 | ulmclm 26508 | . . . 4 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐻‘𝑥)) |
| 25 | climuni 15593 | . . . 4 ⊢ (((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐺‘𝑥) ∧ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐻‘𝑥)) → (𝐺‘𝑥) = (𝐻‘𝑥)) | |
| 26 | 22, 24, 25 | syl2anc 595 | . . 3 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝐺‘𝑥) = (𝐻‘𝑥)) |
| 27 | ulmf 26503 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → ∃𝑛 ∈ ℤ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) | |
| 28 | 27 | ad2antrr 738 | . . 3 ⊢ (((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) → ∃𝑛 ∈ ℤ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) |
| 29 | 26, 28 | r19.29a 3173 | . 2 ⊢ (((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) → (𝐺‘𝑥) = (𝐻‘𝑥)) |
| 30 | 3, 6, 29 | eqfnfvd 7018 | 1 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺 = 𝐻) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∃wrex 3089 Vcvv 3457 class class class wbr 5105 ↦ cmpt 5186 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 ↑m cmap 8812 ℂcc 11086 ℤcz 12582 ℤ≥cuz 12853 ⇝ cli 15525 ⇝𝑢culm 26497 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-map 8814 df-pm 8815 df-en 8932 df-dom 8933 df-sdom 8934 df-sup 9390 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-seq 14029 df-exp 14089 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-clim 15529 df-ulm 26498 |
| This theorem is referenced by: ulmdm 26514 |
| Copyright terms: Public domain | W3C validator |