Theorem evlval 22442

Description: Value of the simple/same ring evaluation map. (Contributed by Stefan O'Rear, 19-Mar-2015.) (Revised by Mario Carneiro, 12-Jun-2015.)

Hypotheses

Ref	Expression
evlval.q	⊢ 𝑄 = (𝐼 eval 𝑅)
evlval.b	⊢ 𝐵 = (Base‘𝑅)

Assertion

Ref	Expression
evlval	⊢ 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)

Proof of Theorem evlval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		evlval.q	. 2 ⊢ 𝑄 = (𝐼 eval 𝑅)
2		oveq12 7455	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 evalSub 𝑟) = (𝐼 evalSub 𝑅))
3		fveq2 6911	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
4		evlval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
5	3, 4	eqtr4di 2816	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
6	5	adantl 487	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = 𝐵)
7	2, 6	fveq12d 6918	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑖 evalSub 𝑟)‘(Base‘𝑟)) = ((𝐼 evalSub 𝑅)‘𝐵))
8		df-evl 22417	. . . 4 ⊢ eval = (𝑖 ∈ V, 𝑟 ∈ V ↦ ((𝑖 evalSub 𝑟)‘(Base‘𝑟)))
9		fvex 6924	. . . 4 ⊢ ((𝐼 evalSub 𝑅)‘𝐵) ∈ V
10	7, 8, 9	ovmpoa 7602	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
11	8	mpondm0 7688	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ∅)
12		0fv 6952	. . . . 5 ⊢ (∅‘𝐵) = ∅
13	11, 12	eqtr4di 2816	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = (∅‘𝐵))
14		reldmevls 22426	. . . . . 6 ⊢ Rel dom evalSub
15	14	ovprc 7484	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 evalSub 𝑅) = ∅)
16	15	fveq1d 6913	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ((𝐼 evalSub 𝑅)‘𝐵) = (∅‘𝐵))
17	13, 16	eqtr4d 2801	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
18	10, 17	pm2.61i 184	. 2 ⊢ (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵)
19	1, 18	eqtri 2786	1 ⊢ 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  ‘cfv 6561  (class class class)co 7446  Basecbs 17419   evalSub ces 22414   eval cevl 22415

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-sep 5253  ax-nul 5264  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-evls 22416  df-evl 22417

This theorem is used by:  evlrhm  22443  evlsscasrng  22447  evlsvarsrng  22449  evlsevl  22474  evl1fval1lem  22681  evl1sca  22685  evl1var  22687  pf1rcl  22700  mpfpf1  22702  pf1ind  22706  evlextv  34257  mhphf4  43832  mzpmfp  43962