MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  evlval Structured version   Visualization version   GIF version

Theorem evlval 22415
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.
StepHypRef Expression
1 evlval.q . 2 𝑄 = (𝐼 eval 𝑅)
2 oveq12 7430 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 evalSub 𝑟) = (𝐼 evalSub 𝑅))
3 fveq2 6886 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
4 evlval.b . . . . . . 7 𝐵 = (Base‘𝑅)
53, 4eqtr4di 2813 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
65adantl 487 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = 𝐵)
72, 6fveq12d 6893 . . . 4 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑖 evalSub 𝑟)‘(Base‘𝑟)) = ((𝐼 evalSub 𝑅)‘𝐵))
8 df-evl 22390 . . . 4 eval = (𝑖 ∈ V, 𝑟 ∈ V ↦ ((𝑖 evalSub 𝑟)‘(Base‘𝑟)))
9 fvex 6899 . . . 4 ((𝐼 evalSub 𝑅)‘𝐵) ∈ V
107, 8, 9ovmpoa 7576 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
118mpondm0 7662 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ∅)
12 0fv 6927 . . . . 5 (∅‘𝐵) = ∅
1311, 12eqtr4di 2813 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = (∅‘𝐵))
14 reldmevls 22399 . . . . . 6 Rel dom evalSub
1514ovprc 7459 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 evalSub 𝑅) = ∅)
1615fveq1d 6888 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ((𝐼 evalSub 𝑅)‘𝐵) = (∅‘𝐵))
1713, 16eqtr4d 2798 . . 3 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
1810, 17pm2.61i 184 . 2 (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵)
191, 18eqtri 2783 1 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ∅c0 4278  ‘cfv 6539  (class class class)co 7421  Basecbs 17393   evalSub ces 22387   eval cevl 22388
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-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-evls 22389  df-evl 22390
This theorem is used by:  evlrhm  22416  evlsscasrng  22420  evlsvarsrng  22422  evlsevl  22447  evl1fval1lem  22654  evl1sca  22658  evl1var  22660  pf1rcl  22673  mpfpf1  22675  pf1ind  22679  evlextv  34221  mhphf4  43722  mzpmfp  43852
  Copyright terms: Public domain W3C validator