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 26737

Description: Lemma for ulmdv 26739. (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 7457	. . . . . 6 ⊢ (𝑆 D (𝐹‘𝑘)) ∈ V
2	1	rgenw 3080	. . . . 5 ⊢ ∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V
3		eqid 2760	. . . . . 6 ⊢ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) = (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))
4	3	fnmpt 6684	. . . . 5 ⊢ (∀𝑘 ∈ 𝑍 (𝑆 D (𝐹‘𝑘)) ∈ V → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
5	2, 4	mp1i 14	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍)
6		ulmdv.u	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻)
7		ulmf2 26720	. . . 4 ⊢ (((𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))) Fn 𝑍 ∧ (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘)))(⇝_𝑢‘𝑋)𝐻) → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
8	5, 6, 7	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝑆 D (𝐹‘𝑘))):𝑍⟶(ℂ ↑_m 𝑋))
9	8	fvmptelcdm 7118	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋))
10		elmapi 8877	. 2 ⊢ ((𝑆 D (𝐹‘𝑘)) ∈ (ℂ ↑_m 𝑋) → (𝑆 D (𝐹‘𝑘)):𝑋⟶ℂ)
11		fdm 6724	. 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 1569 ∈ wcel 2144 ∀wral 3076 Vcvv 3450 {cpr 4586 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5651 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ↑_m cmap 8855 ℂcc 11205 ℝcr 11206 ℤcz 12700 ℤ_≥cuz 12972 ⇝ cli 15660 D cdv 26192 ⇝_𝑢culm 26712

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 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 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-1st 8005 df-2nd 8006 df-map 8857 df-pm 8858 df-neg 11551 df-z 12701 df-uz 12973 df-ulm 26713

This theorem is used by: ulmdvlem3 26738 ulmdv 26739

W3C validator