| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ulmi | Structured version Visualization version GIF version | ||
| Description: The uniform limit property. (Contributed by Mario Carneiro, 27-Feb-2015.) |
| Ref | Expression |
|---|---|
| ulm2.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| ulm2.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| ulm2.f | ⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑m 𝑆)) |
| ulm2.b | ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑍 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑘)‘𝑧) = 𝐵) |
| ulm2.a | ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (𝐺‘𝑧) = 𝐴) |
| ulmi.u | ⊢ (𝜑 → 𝐹(⇝𝑢‘𝑆)𝐺) |
| ulmi.c | ⊢ (𝜑 → 𝐶 ∈ ℝ+) |
| Ref | Expression |
|---|---|
| ulmi | ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq2 5115 | . . . 4 ⊢ (𝑥 = 𝐶 → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝐶)) | |
| 2 | 1 | ralbidv 3190 | . . 3 ⊢ (𝑥 = 𝐶 → (∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶)) |
| 3 | 2 | rexralbidv 3233 | . 2 ⊢ (𝑥 = 𝐶 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶)) |
| 4 | ulmi.u | . . 3 ⊢ (𝜑 → 𝐹(⇝𝑢‘𝑆)𝐺) | |
| 5 | ulm2.z | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 6 | ulm2.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 7 | ulm2.f | . . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑m 𝑆)) | |
| 8 | ulm2.b | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝑍 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑘)‘𝑧) = 𝐵) | |
| 9 | ulm2.a | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (𝐺‘𝑧) = 𝐴) | |
| 10 | ulmcl 26595 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ) | |
| 11 | 4, 10 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐺:𝑆⟶ℂ) |
| 12 | ulmscl 26593 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝑆 ∈ V) | |
| 13 | 4, 12 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 14 | 5, 6, 7, 8, 9, 11, 13 | ulm2 26599 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥)) |
| 15 | 4, 14 | mpbid 235 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥) |
| 16 | ulmi.c | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 17 | 3, 15, 16 | rspcdva 3584 | 1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 Vcvv 3457 class class class wbr 5111 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 ↑m cmap 8830 ℂcc 11113 < clt 11258 − cmin 11456 ℤcz 12606 ℤ≥cuz 12878 ℝ+crp 13032 abscabs 15309 ⇝𝑢culm 26590 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-pre-lttri 11189 ax-pre-lttrn 11190 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-er 8700 df-map 8832 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-neg 11459 df-z 12607 df-uz 12879 df-ulm 26591 |
| This theorem is used by: ulmshftlem 26603 ulmcau 26609 ulmbdd 26612 ulmcn 26613 iblulm 26621 itgulm 26622 |
| Copyright terms: Public domain | W3C validator |