ulmi - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ulmi		Structured version Visualization version GIF version

Theorem ulmi 26347

Description: The uniform limit property. (Contributed by Mario Carneiro, 27-Feb-2015.)

**Hypotheses**
Ref	Expression
ulm2.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
ulm2.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
ulm2.f	⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑_m 𝑆))
ulm2.b	⊢ ((𝜑 ∧ (𝑘 ∈ 𝑍 ∧ 𝑧 ∈ 𝑆)) → ((𝐹‘𝑘)‘𝑧) = 𝐵)
ulm2.a	⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (𝐺‘𝑧) = 𝐴)
ulmi.u	⊢ (𝜑 → 𝐹(⇝_𝑢‘𝑆)𝐺)
ulmi.c	⊢ (𝜑 → 𝐶 ∈ ℝ⁺)

**Assertion**
Ref	Expression
ulmi	⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶)

Distinct variable groups: 𝑗,𝑘,𝑧,𝐹 𝑗,𝐺,𝑘,𝑧 𝑗,𝑀,𝑘,𝑧 𝜑,𝑗,𝑘,𝑧 𝐴,𝑗,𝑘 𝐶,𝑗,𝑘,𝑧 𝑆,𝑗,𝑘,𝑧 𝑗,𝑍 Allowed substitution hints: 𝐴(𝑧) 𝐵(𝑧,𝑗,𝑘) 𝑍(𝑧,𝑘)

Proof of Theorem ulmi Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 5123	. . . 4 ⊢ (𝑥 = 𝐶 → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝐶))
2	1	ralbidv 3163	. . 3 ⊢ (𝑥 = 𝐶 → (∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶))
3	2	rexralbidv 3207	. 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 26342	. . . . 5 ⊢ (𝐹(⇝_𝑢‘𝑆)𝐺 → 𝐺:𝑆⟶ℂ)
11	4, 10	syl 17	. . . 4 ⊢ (𝜑 → 𝐺:𝑆⟶ℂ)
12		ulmscl 26340	. . . . 5 ⊢ (𝐹(⇝_𝑢‘𝑆)𝐺 → 𝑆 ∈ V)
13	4, 12	syl 17	. . . 4 ⊢ (𝜑 → 𝑆 ∈ V)
14	5, 6, 7, 8, 9, 11, 13	ulm2 26346	. . 3 ⊢ (𝜑 → (𝐹(⇝_𝑢‘𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥))
15	4, 14	mpbid 232	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝑥)
16		ulmi.c	. 2 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
17	3, 15, 16	rspcdva 3602	1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)∀𝑧 ∈ 𝑆 (abs‘(𝐵 − 𝐴)) < 𝐶)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∀wral 3051 ∃wrex 3060 Vcvv 3459 class class class wbr 5119 ⟶wf 6527 ‘cfv 6531 (class class class)co 7405 ↑_m cmap 8840 ℂcc 11127 < clt 11269 − cmin 11466 ℤcz 12588 ℤ_≥cuz 12852 ℝ⁺crp 13008 abscabs 15253 ⇝_𝑢culm 26337

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-pre-lttri 11203 ax-pre-lttrn 11204

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-po 5561 df-so 5562 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7408 df-oprab 7409 df-mpo 7410 df-er 8719 df-map 8842 df-pm 8843 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-neg 11469 df-z 12589 df-uz 12853 df-ulm 26338

This theorem is referenced by: ulmshftlem 26350 ulmcau 26356 ulmbdd 26359 ulmcn 26360 iblulm 26368 itgulm 26369

W3C validator