| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rlimdm | Structured version Visualization version GIF version | ||
| Description: Two ways to express that a function has a limit. (The expression ( ⇝𝑟 ‘𝐹) is sometimes useful as a shorthand for "the unique limit of the function 𝐹"). (Contributed by Mario Carneiro, 8-May-2016.) |
| Ref | Expression |
|---|---|
| rlimuni.1 | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
| rlimuni.2 | ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) |
| Ref | Expression |
|---|---|
| rlimdm | ⊢ (𝜑 → (𝐹 ∈ dom ⇝𝑟 ↔ 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldmg 5892 | . . . 4 ⊢ (𝐹 ∈ dom ⇝𝑟 → (𝐹 ∈ dom ⇝𝑟 ↔ ∃𝑥 𝐹 ⇝𝑟 𝑥)) | |
| 2 | 1 | ibi 270 | . . 3 ⊢ (𝐹 ∈ dom ⇝𝑟 → ∃𝑥 𝐹 ⇝𝑟 𝑥) |
| 3 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → 𝐹 ⇝𝑟 𝑥) | |
| 4 | df-fv 6574 | . . . . . . 7 ⊢ ( ⇝𝑟 ‘𝐹) = (℩𝑦𝐹 ⇝𝑟 𝑦) | |
| 5 | rlimuni.1 | . . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
| 6 | 5 | adantr 486 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐹 ⇝𝑟 𝑥 ∧ 𝐹 ⇝𝑟 𝑦)) → 𝐹:𝐴⟶ℂ) |
| 7 | rlimuni.2 | . . . . . . . . . . . . . 14 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) | |
| 8 | 7 | adantr 486 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐹 ⇝𝑟 𝑥 ∧ 𝐹 ⇝𝑟 𝑦)) → sup(𝐴, ℝ*, < ) = +∞) |
| 9 | simprr 785 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐹 ⇝𝑟 𝑥 ∧ 𝐹 ⇝𝑟 𝑦)) → 𝐹 ⇝𝑟 𝑦) | |
| 10 | simprl 783 | . . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐹 ⇝𝑟 𝑥 ∧ 𝐹 ⇝𝑟 𝑦)) → 𝐹 ⇝𝑟 𝑥) | |
| 11 | 6, 8, 9, 10 | rlimuni 15761 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐹 ⇝𝑟 𝑥 ∧ 𝐹 ⇝𝑟 𝑦)) → 𝑦 = 𝑥) |
| 12 | 11 | expr 462 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → (𝐹 ⇝𝑟 𝑦 → 𝑦 = 𝑥)) |
| 13 | breq2 5112 | . . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝐹 ⇝𝑟 𝑦 ↔ 𝐹 ⇝𝑟 𝑥)) | |
| 14 | 3, 13 | syl5ibrcom 250 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → (𝑦 = 𝑥 → 𝐹 ⇝𝑟 𝑦)) |
| 15 | 12, 14 | impbid 215 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → (𝐹 ⇝𝑟 𝑦 ↔ 𝑦 = 𝑥)) |
| 16 | 15 | adantr 486 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) ∧ 𝑥 ∈ V) → (𝐹 ⇝𝑟 𝑦 ↔ 𝑦 = 𝑥)) |
| 17 | 16 | iota5 6548 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) ∧ 𝑥 ∈ V) → (℩𝑦𝐹 ⇝𝑟 𝑦) = 𝑥) |
| 18 | 17 | elvd 3460 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → (℩𝑦𝐹 ⇝𝑟 𝑦) = 𝑥) |
| 19 | 4, 18 | eqtrid 2810 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → ( ⇝𝑟 ‘𝐹) = 𝑥) |
| 20 | 3, 19 | breqtrrd 5139 | . . . . 5 ⊢ ((𝜑 ∧ 𝐹 ⇝𝑟 𝑥) → 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹)) |
| 21 | 20 | ex 418 | . . . 4 ⊢ (𝜑 → (𝐹 ⇝𝑟 𝑥 → 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹))) |
| 22 | 21 | exlimdv 1968 | . . 3 ⊢ (𝜑 → (∃𝑥 𝐹 ⇝𝑟 𝑥 → 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹))) |
| 23 | 2, 22 | syl5 35 | . 2 ⊢ (𝜑 → (𝐹 ∈ dom ⇝𝑟 → 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹))) |
| 24 | rlimrel 15704 | . . 3 ⊢ Rel ⇝𝑟 | |
| 25 | 24 | releldmi 5942 | . 2 ⊢ (𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹) → 𝐹 ∈ dom ⇝𝑟 ) |
| 26 | 23, 25 | impbid1 228 | 1 ⊢ (𝜑 → (𝐹 ∈ dom ⇝𝑟 ↔ 𝐹 ⇝𝑟 ( ⇝𝑟 ‘𝐹))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 Vcvv 3454 class class class wbr 5108 dom cdm 5658 ℩cio 6518 ⟶wf 6562 ‘cfv 6566 supcsup 9469 ℂcc 11237 +∞cpnf 11379 ℝ*cxr 11381 < clt 11382 ⇝𝑟 crli 15696 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-rlim 15700 |
| This theorem is used by: caucvgrlem2 15886 caucvg 15890 dchrisum0lem3 27903 |
| Copyright terms: Public domain | W3C validator |