| 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 5106 | . . . 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 26717 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ) | |
| 11 | 4, 10 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐺:𝑆⟶ℂ) |
| 12 | ulmscl 26715 | . . . . 5 ⊢ (𝐹(⇝𝑢‘𝑆)𝐺 → 𝑆 ∈ V) | |
| 13 | 4, 12 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ V) |
| 14 | 5, 6, 7, 8, 9, 11, 13 | ulm2 26721 | . . 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 1569 ∈ wcel 2144 ∀wral 3076 ∃wrex 3086 Vcvv 3450 class class class wbr 5102 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ↑m cmap 8855 ℂcc 11205 < clt 11350 − cmin 11548 ℤcz 12700 ℤ≥cuz 12972 ℝ+crp 13127 abscabs 15410 ⇝𝑢culm 26712 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-pre-lttri 11281 ax-pre-lttrn 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-er 8725 df-map 8857 df-pm 8858 df-en 8982 df-dom 8983 df-sdom 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-neg 11551 df-z 12701 df-uz 12973 df-ulm 26713 |
| This theorem is used by: ulmshftlem 26725 ulmcau 26731 ulmbdd 26734 ulmcn 26735 iblulm 26743 itgulm 26744 |
| Copyright terms: Public domain | W3C validator |