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 26369

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

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 Vcvv 3431 class class class wbr 5072 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 ↑_m cmap 8763 ℂcc 11027 < clt 11170 − cmin 11368 ℤcz 12515 ℤ_≥cuz 12779 ℝ⁺crp 12933 abscabs 15187 ⇝_𝑢culm 26359

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-pre-lttri 11103 ax-pre-lttrn 11104

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-po 5526 df-so 5527 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8633 df-map 8765 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-neg 11371 df-z 12516 df-uz 12780 df-ulm 26360

This theorem is referenced by: ulmshftlem 26372 ulmcau 26378 ulmbdd 26381 ulmcn 26382 iblulm 26390 itgulm 26391

W3C validator