![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > climeqmpt | Structured version Visualization version GIF version |
Description: Two functions that are eventually equal to one another have the same limit. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
climeqmpt.x | ⊢ Ⅎ𝑥𝜑 |
climeqmpt.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
climeqmpt.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
climeqmpt.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
climeqmpt.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
climeqmpt.s | ⊢ (𝜑 → 𝑍 ⊆ 𝐴) |
climeqmpt.t | ⊢ (𝜑 → 𝑍 ⊆ 𝐵) |
climeqmpt.c | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝐶 ∈ 𝑈) |
Ref | Expression |
---|---|
climeqmpt | ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ⇝ 𝐷 ↔ (𝑥 ∈ 𝐵 ↦ 𝐶) ⇝ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | climeqmpt.x | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | nfmpt1 5274 | . 2 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶) | |
3 | nfmpt1 5274 | . 2 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐵 ↦ 𝐶) | |
4 | climeqmpt.m | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
5 | climeqmpt.z | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
6 | climeqmpt.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
7 | 6 | mptexd 7261 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ V) |
8 | climeqmpt.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
9 | 8 | mptexd 7261 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ V) |
10 | climeqmpt.s | . . . . . 6 ⊢ (𝜑 → 𝑍 ⊆ 𝐴) | |
11 | 10 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝑍 ⊆ 𝐴) |
12 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝑥 ∈ 𝑍) | |
13 | 11, 12 | sseldd 4009 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝑥 ∈ 𝐴) |
14 | climeqmpt.c | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝐶 ∈ 𝑈) | |
15 | eqid 2740 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶) | |
16 | 15 | fvmpt2 7040 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝑈) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶) |
17 | 13, 14, 16 | syl2anc 583 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶) |
18 | climeqmpt.t | . . . . . . 7 ⊢ (𝜑 → 𝑍 ⊆ 𝐵) | |
19 | 18 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝑍 ⊆ 𝐵) |
20 | 19, 12 | sseldd 4009 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝑥 ∈ 𝐵) |
21 | eqid 2740 | . . . . . 6 ⊢ (𝑥 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) | |
22 | 21 | fvmpt2 7040 | . . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐶 ∈ 𝑈) → ((𝑥 ∈ 𝐵 ↦ 𝐶)‘𝑥) = 𝐶) |
23 | 20, 14, 22 | syl2anc 583 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → ((𝑥 ∈ 𝐵 ↦ 𝐶)‘𝑥) = 𝐶) |
24 | 23 | eqcomd 2746 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝐶 = ((𝑥 ∈ 𝐵 ↦ 𝐶)‘𝑥)) |
25 | 17, 24 | eqtrd 2780 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = ((𝑥 ∈ 𝐵 ↦ 𝐶)‘𝑥)) |
26 | 1, 2, 3, 4, 5, 7, 9, 25 | climeqf 45609 | 1 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ⇝ 𝐷 ↔ (𝑥 ∈ 𝐵 ↦ 𝐶) ⇝ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 Ⅎwnf 1781 ∈ wcel 2108 Vcvv 3488 ⊆ wss 3976 class class class wbr 5166 ↦ cmpt 5249 ‘cfv 6573 ℤcz 12639 ℤ≥cuz 12903 ⇝ cli 15530 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-pre-lttri 11258 ax-pre-lttrn 11259 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-neg 11523 df-z 12640 df-uz 12904 df-clim 15534 |
This theorem is referenced by: smflimsuplem6 46746 smflimsuplem8 46748 |
Copyright terms: Public domain | W3C validator |