Theorem evlval 22322

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 7426	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 evalSub 𝑟) = (𝐼 evalSub 𝑅))
3		fveq2 6882	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
4		evlval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
5	3, 4	eqtr4di 2815	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
6	5	adantl 487	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = 𝐵)
7	2, 6	fveq12d 6889	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑖 evalSub 𝑟)‘(Base‘𝑟)) = ((𝐼 evalSub 𝑅)‘𝐵))
8		df-evl 22297	. . . 4 ⊢ eval = (𝑖 ∈ V, 𝑟 ∈ V ↦ ((𝑖 evalSub 𝑟)‘(Base‘𝑟)))
9		fvex 6895	. . . 4 ⊢ ((𝐼 evalSub 𝑅)‘𝐵) ∈ V
10	7, 8, 9	ovmpoa 7572	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
11	8	mpondm0 7658	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ∅)
12		0fv 6923	. . . . 5 ⊢ (∅‘𝐵) = ∅
13	11, 12	eqtr4di 2815	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = (∅‘𝐵))
14		reldmevls 22306	. . . . . 6 ⊢ Rel dom evalSub
15	14	ovprc 7455	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 evalSub 𝑅) = ∅)
16	15	fveq1d 6884	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ((𝐼 evalSub 𝑅)‘𝐵) = (∅‘𝐵))
17	13, 16	eqtr4d 2800	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
18	10, 17	pm2.61i 184	. 2 ⊢ (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵)
19	1, 18	eqtri 2785	1 ⊢ 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ∅c0 4282  ‘cfv 6537  (class class class)co 7417  Basecbs 17307   evalSub ces 22294   eval cevl 22295

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-evls 22296  df-evl 22297

This theorem is used by:  evlrhm  22323  evlsscasrng  22327  evlsvarsrng  22329  evlsevl  22354  evl1fval1lem  22561  evl1sca  22565  evl1var  22567  pf1rcl  22580  mpfpf1  22582  pf1ind  22586  evlextv  34060  mhphf4  43454  mzpmfp  43600