| 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 26371 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ) | |
| 2 | 1 | adantr 481 | . . 3 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺:𝑆⟶ℂ) |
| 3 | 2 | ffnd 6663 | . 2 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺 Fn 𝑆) |
| 4 | ulmcl 26371 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐻 → 𝐻:𝑆⟶ℂ) | |
| 5 | 4 | adantl 482 | . . 3 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐻:𝑆⟶ℂ) |
| 6 | 5 | ffnd 6663 | . 2 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐻 Fn 𝑆) |
| 7 | eqid 2740 | . . . . 5 ⊢ (ℤ≥‘𝑛) = (ℤ≥‘𝑛) | |
| 8 | simplr 774 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝑛 ∈ ℤ) | |
| 9 | simpr 485 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) | |
| 10 | simpllr 781 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝑥 ∈ 𝑆) | |
| 11 | fvex 6847 | . . . . . . 7 ⊢ (ℤ≥‘𝑛) ∈ V | |
| 12 | 11 | mptex 7174 | . . . . . 6 ⊢ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ∈ V |
| 13 | 12 | a1i 11 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ∈ V) |
| 14 | fveq2 6834 | . . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (𝐹‘𝑖) = (𝐹‘𝑘)) | |
| 15 | 14 | fveq1d 6836 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → ((𝐹‘𝑖)‘𝑥) = ((𝐹‘𝑘)‘𝑥)) |
| 16 | eqid 2740 | . . . . . . . 8 ⊢ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) = (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) | |
| 17 | fvex 6847 | . . . . . . . 8 ⊢ ((𝐹‘𝑘)‘𝑥) ∈ V | |
| 18 | 15, 16, 17 | fvmpt 6942 | . . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑛) → ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘) = ((𝐹‘𝑘)‘𝑥)) |
| 19 | 18 | eqcomd 2746 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑛) → ((𝐹‘𝑘)‘𝑥) = ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘)) |
| 20 | 19 | adantl 482 | . . . . 5 ⊢ ((((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) ∧ 𝑘 ∈ (ℤ≥‘𝑛)) → ((𝐹‘𝑘)‘𝑥) = ((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥))‘𝑘)) |
| 21 | simp-4l 788 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹(⇝𝑢‘𝑆)𝐺) | |
| 22 | 7, 8, 9, 10, 13, 20, 21 | ulmclm 26377 | . . . 4 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐺‘𝑥)) |
| 23 | simp-4r 789 | . . . . 5 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → 𝐹(⇝𝑢‘𝑆)𝐻) | |
| 24 | 7, 8, 9, 10, 13, 20, 23 | ulmclm 26377 | . . . 4 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐻‘𝑥)) |
| 25 | climuni 15512 | . . . 4 ⊢ (((𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐺‘𝑥) ∧ (𝑖 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑖)‘𝑥)) ⇝ (𝐻‘𝑥)) → (𝐺‘𝑥) = (𝐻‘𝑥)) | |
| 26 | 22, 24, 25 | syl2anc 590 | . . 3 ⊢ (((((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) ∧ 𝑛 ∈ ℤ) ∧ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) → (𝐺‘𝑥) = (𝐻‘𝑥)) |
| 27 | ulmf 26372 | . . . 4 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → ∃𝑛 ∈ ℤ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) | |
| 28 | 27 | ad2antrr 732 | . . 3 ⊢ (((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) → ∃𝑛 ∈ ℤ 𝐹:(ℤ≥‘𝑛)⟶(ℂ ↑m 𝑆)) |
| 29 | 26, 28 | r19.29a 3148 | . 2 ⊢ (((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) ∧ 𝑥 ∈ 𝑆) → (𝐺‘𝑥) = (𝐻‘𝑥)) |
| 30 | 3, 6, 29 | eqfnfvd 6981 | 1 ⊢ ((𝐹(⇝𝑢‘𝑆)𝐺 ∧ 𝐹(⇝𝑢‘𝑆)𝐻) → 𝐺 = 𝐻) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 Vcvv 3432 class class class wbr 5079 ↦ cmpt 5160 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 ↑m cmap 8770 ℂcc 11034 ℤcz 12522 ℤ≥cuz 12786 ⇝ cli 15444 ⇝𝑢culm 26366 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-map 8772 df-pm 8773 df-en 8891 df-dom 8892 df-sdom 8893 df-sup 9352 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-z 12523 df-uz 12787 df-rp 12941 df-seq 13962 df-exp 14022 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-clim 15448 df-ulm 26367 |
| This theorem is referenced by: ulmdm 26383 |
| Copyright terms: Public domain | W3C validator |