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 26728

Description: Lemma for ulmdv 26730. (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 7453	. . . . . 6 ⊢ (𝑆 D (𝐹‘𝑘)) ∈ V
2	1	rgenw 3081	. . . . 5 ⊢ ∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V
3		eqid 2761	. . . . . 6 ⊢ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) = (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))
4	3	fnmpt 6679	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
5	2, 4	mp1i 14	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
6		ulmdv.u	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻)
7		ulmf2 26711	. . . 4 ⊢ (((𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍 ∧ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻) → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
8	5, 6, 7	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
9	8	fvmptelcdm 7113	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋))
10		elmapi 8869	. 2 ⊢ ((𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋) → (𝑆 D (𝐹‘𝑘)):𝑋⟶ℂ)
11		fdm 6719	. 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 3077 Vcvv 3451 {cpr 4586 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ↑_m cmap 8847 ℂcc 11198 ℝcr 11199 ℤcz 12693 ℤ_≥cuz 12965 ⇝ cli 15651 D cdv 26183 ⇝_𝑢culm 26703

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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 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 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-map 8849 df-pm 8850 df-neg 11544 df-z 12694 df-uz 12966 df-ulm 26704

This theorem is used by: ulmdvlem3 26729 ulmdv 26730

W3C validator