Theorem reldmevls 19338

Description: Well-behaved binary operation property of evalSub. (Contributed by Stefan O'Rear, 19-Mar-2015.)

Assertion

Ref	Expression
reldmevls	⊢ Rel dom evalSub

Proof of Theorem reldmevls

Dummy variables 𝑏 𝑓 𝑔 𝑖 𝑟 𝑠 𝑤 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-evls 19327	. 2 ⊢ evalSub = (𝑖 ∈ V, 𝑠 ∈ CRing ↦ ⦋(Base‘𝑠) / 𝑏⦌(𝑟 ∈ (SubRing‘𝑠) ↦ ⦋(𝑖 mPoly (𝑠 ↾s 𝑟)) / 𝑤⦌(℩𝑓 ∈ (𝑤 RingHom (𝑠 ↑s (𝑏 ↑𝑚 𝑖)))((𝑓 ∘ (algSc‘𝑤)) = (𝑥 ∈ 𝑟 ↦ ((𝑏 ↑𝑚 𝑖) × {𝑥})) ∧ (𝑓 ∘ (𝑖 mVar (𝑠 ↾s 𝑟))) = (𝑥 ∈ 𝑖 ↦ (𝑔 ∈ (𝑏 ↑𝑚 𝑖) ↦ (𝑔‘𝑥)))))))
2	1	reldmmpt2 6669	1 ⊢ Rel dom evalSub

Syntax hints:   ∧ wa 383   = wceq 1475  Vcvv 3173  ⦋csb 3499  {csn 4125   ↦ cmpt 4643   × cxp 5036  dom cdm 5038   ∘ ccom 5042  Rel wrel 5043  ‘cfv 5804  ℩crio 6510  (class class class)co 6549   ↑_𝑚 cmap 7744  Basecbs 15695   ↾_s cress 15696   ↑_s cpws 15930  CRingccrg 18371   RingHom crh 18535  SubRingcsubrg 18599  algSccascl 19132   mVar cmvr 19173   mPoly cmpl 19174   evalSub ces 19325

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-dm 5048  df-oprab 6553  df-mpt2 6554  df-evls 19327

This theorem is referenced by:  mpfrcl  19339  evlval  19345