Theorem evlval 22389

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 7421	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 evalSub 𝑟) = (𝐼 evalSub 𝑅))
3		fveq2 6877	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
4		evlval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
5	3, 4	eqtr4di 2814	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
6	5	adantl 487	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = 𝐵)
7	2, 6	fveq12d 6884	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑖 evalSub 𝑟)‘(Base‘𝑟)) = ((𝐼 evalSub 𝑅)‘𝐵))
8		df-evl 22364	. . . 4 ⊢ eval = (𝑖 ∈ V, 𝑟 ∈ V ↦ ((𝑖 evalSub 𝑟)‘(Base‘𝑟)))
9		fvex 6890	. . . 4 ⊢ ((𝐼 evalSub 𝑅)‘𝐵) ∈ V
10	7, 8, 9	ovmpoa 7567	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
11	8	mpondm0 7653	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ∅)
12		0fv 6918	. . . . 5 ⊢ (∅‘𝐵) = ∅
13	11, 12	eqtr4di 2814	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = (∅‘𝐵))
14		reldmevls 22373	. . . . . 6 ⊢ Rel dom evalSub
15	14	ovprc 7450	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 evalSub 𝑅) = ∅)
16	15	fveq1d 6879	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ((𝐼 evalSub 𝑅)‘𝐵) = (∅‘𝐵))
17	13, 16	eqtr4d 2799	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
18	10, 17	pm2.61i 184	. 2 ⊢ (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵)
19	1, 18	eqtri 2784	1 ⊢ 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ∅c0 4279  ‘cfv 6531  (class class class)co 7412  Basecbs 17367   evalSub ces 22361   eval cevl 22362

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-sep 5249  ax-nul 5260  ax-pr 5391

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 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-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-evls 22363  df-evl 22364

This theorem is used by:  evlrhm  22390  evlsscasrng  22394  evlsvarsrng  22396  evlsevl  22421  evl1fval1lem  22628  evl1sca  22632  evl1var  22634  pf1rcl  22647  mpfpf1  22649  pf1ind  22653  evlextv  34156  mhphf4  43590  mzpmfp  43711