| 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 5107 | . . . 4 ⊢ (𝑥 = 𝐶 → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝐶)) | |
| 2 | 1 | ralbidv 3185 | . . 3 ⊢ (𝑥 = 𝐶 → (∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶)) |
| 3 | 2 | rexralbidv 3228 | . 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 26618 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ) | |
| 11 | 4, 10 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐺:𝑆⟶ℂ) |
| 12 | ulmscl 26616 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝑆 ∈ V) | |
| 13 | 4, 12 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 14 | 5, 6, 7, 8, 9, 11, 13 | ulm2 26622 | . . 3 ⊢ (𝜑 → (𝐹(⇝𝑢‘𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥)) |
| 15 | 4, 14 | mpbid 235 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥) |
| 16 | ulmi.c | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 17 | 3, 15, 16 | rspcdva 3577 | 1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 Vcvv 3450 class class class wbr 5103 ⟶wf 6529 ‘cfv 6533 (class class class)co 7414 ↑m cmap 8827 ℂcc 11123 < clt 11268 − cmin 11466 ℤcz 12616 ℤ≥cuz 12888 ℝ+crp 13043 abscabs 15322 ⇝𝑢culm 26613 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-pre-lttri 11199 ax-pre-lttrn 11200 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-er 8697 df-map 8829 df-pm 8830 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-neg 11469 df-z 12617 df-uz 12889 df-ulm 26614 |
| This theorem is used by: ulmshftlem 26626 ulmcau 26632 ulmbdd 26635 ulmcn 26636 iblulm 26644 itgulm 26645 |
| Copyright terms: Public domain | W3C validator |