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 26351

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

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 Vcvv 3440 class class class wbr 5098 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ↑_m cmap 8763 ℂcc 11024 < clt 11166 − cmin 11364 ℤcz 12488 ℤ_≥cuz 12751 ℝ⁺crp 12905 abscabs 15157 ⇝_𝑢culm 26341

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-pre-lttri 11100 ax-pre-lttrn 11101

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-map 8765 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-neg 11367 df-z 12489 df-uz 12752 df-ulm 26342

This theorem is referenced by: ulmshftlem 26354 ulmcau 26360 ulmbdd 26363 ulmcn 26364 iblulm 26372 itgulm 26373

W3C validator