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 26785

Description: Lemma for ulmdv 26787. (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 7484	. . . . . 6 ⊢ (𝑆 D (𝐹‘𝑘)) ∈ V
2	1	rgenw 3084	. . . . 5 ⊢ ∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V
3		eqid 2763	. . . . . 6 ⊢ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) = (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))
4	3	fnmpt 6709	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
5	2, 4	mp1i 14	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
6		ulmdv.u	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻)
7		ulmf2 26768	. . . 4 ⊢ (((𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍 ∧ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻) → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
8	5, 6, 7	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
9	8	fvmptelcdm 7145	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋))
10		elmapi 8907	. 2 ⊢ ((𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋) → (𝑆 D (𝐹‘𝑘)):𝑋⟶ℂ)
11		fdm 6749	. 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 2147 ∀wral 3080 Vcvv 3454 {cpr 4590 class class class wbr 5108 ↦ cmpt 5192 dom cdm 5658 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ↑_m cmap 8885 ℂcc 11237 ℝcr 11238 ℤcz 12733 ℤ_≥cuz 13005 ⇝ cli 15695 D cdv 26238 ⇝_𝑢culm 26760

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-map 8887 df-pm 8888 df-neg 11583 df-z 12734 df-uz 13006 df-ulm 26761

This theorem is used by: ulmdvlem3 26786 ulmdv 26787

W3C validator