ulmdvlem2 - Metamath Proof Explorer

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

Theorem ulmdvlem2 26638

Description: Lemma for ulmdv 26640. (Contributed by Mario Carneiro, 8-May-2015.)

**Hypotheses**
Ref	Expression
ulmdv.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
ulmdv.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
ulmdv.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
ulmdv.f	⊢ (𝜑 → 𝐹:𝑍⟶(ℂ ↑_m 𝑋))
ulmdv.g	⊢ (𝜑 → 𝐺:𝑋⟶ℂ)
ulmdv.l	⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝑘 ∈ 𝑍 ↦ ((𝐹‘𝑘)‘𝑧)) ⇝ (𝐺‘𝑧))
ulmdv.u	⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻)

**Assertion**
Ref	Expression
ulmdvlem2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → dom (𝑆 D (𝐹‘𝑘)) = 𝑋)

Distinct variable groups: 𝑧,𝑘,𝐹 𝑧,𝐺 𝑧,𝐻 𝑘,𝑀 𝜑,𝑘,𝑧 𝑆,𝑘,𝑧 𝑘,𝑋,𝑧 𝑘,𝑍,𝑧 Allowed substitution hints: 𝐺(𝑘) 𝐻(𝑘) 𝑀(𝑧)

**Proof of Theorem ulmdvlem2**
Step	Hyp	Ref	Expression
1		ovex 7447	. . . . . 6 ⊢ (𝑆 D (𝐹‘𝑘)) ∈ V
2	1	rgenw 3080	. . . . 5 ⊢ ∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V
3		eqid 2760	. . . . . 6 ⊢ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) = (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))
4	3	fnmpt 6673	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
5	2, 4	mp1i 14	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
6		ulmdv.u	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻)
7		ulmf2 26621	. . . 4 ⊢ (((𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍 ∧ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻) → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
8	5, 6, 7	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
9	8	fvmptelcdm 7107	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋))
10		elmapi 8849	. 2 ⊢ ((𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋) → (𝑆 D (𝐹‘𝑘)):𝑋⟶ℂ)
11		fdm 6713	. 2 ⊢ ((𝑆 D (𝐹‘𝑘)):𝑋⟶ℂ → dom (𝑆 D (𝐹‘𝑘)) = 𝑋)
12	9, 10, 11	3syl 19	1 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → dom (𝑆 D (𝐹‘𝑘)) = 𝑋)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 {cpr 4586 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5655 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7414 ↑_m cmap 8827 ℂcc 11123 ℝcr 11124 ℤcz 12616 ℤ_≥cuz 12888 ⇝ cli 15572 D cdv 26091 ⇝_𝑢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

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-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-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-1st 7987 df-2nd 7988 df-map 8829 df-pm 8830 df-neg 11469 df-z 12617 df-uz 12889 df-ulm 26614

This theorem is used by: ulmdvlem3 26639 ulmdv 26640

W3C validator