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

Theorem evlval 22288
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 7432 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝑖 evalSub 𝑟) = (𝐼 evalSub 𝑅))
3 fveq2 6888 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
4 evlval.b . . . . . . 7 𝐵 = (Base‘𝑅)
53, 4eqtr4di 2819 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
65adantl 487 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → (Base‘𝑟) = 𝐵)
72, 6fveq12d 6895 . . . 4 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝑖 evalSub 𝑟)‘(Base‘𝑟)) = ((𝐼 evalSub 𝑅)‘𝐵))
8 df-evl 22263 . . . 4 eval = (𝑖 ∈ V, 𝑟 ∈ V ↦ ((𝑖 evalSub 𝑟)‘(Base‘𝑟)))
9 fvex 6901 . . . 4 ((𝐼 evalSub 𝑅)‘𝐵) ∈ V
107, 8, 9ovmpoa 7578 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
118mpondm0 7663 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ∅)
12 0fv 6929 . . . . 5 (∅‘𝐵) = ∅
1311, 12eqtr4di 2819 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = (∅‘𝐵))
14 reldmevls 22272 . . . . . 6 Rel dom evalSub
1514ovprc 7461 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 evalSub 𝑅) = ∅)
1615fveq1d 6890 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → ((𝐼 evalSub 𝑅)‘𝐵) = (∅‘𝐵))
1713, 16eqtr4d 2804 . . 3 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵))
1810, 17pm2.61i 184 . 2 (𝐼 eval 𝑅) = ((𝐼 evalSub 𝑅)‘𝐵)
191, 18eqtri 2789 1 𝑄 = ((𝐼 evalSub 𝑅)‘𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  c0 4289  cfv 6543  (class class class)co 7423  Basecbs 17294   evalSub ces 22260   eval cevl 22261
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-evls 22262  df-evl 22263
This theorem is used by:  evlrhm  22289  evlsscasrng  22293  evlsvarsrng  22295  evlsevl  22320  evl1fval1lem  22527  evl1sca  22531  evl1var  22533  pf1rcl  22546  mpfpf1  22548  pf1ind  22552  evlextv  33963  mhphf4  43373  mzpmfp  43519
  Copyright terms: Public domain W3C validator