Theorem reldmevls1 22690

Description: Well-behaved binary operation property of evalSub₁. (Contributed by AV, 7-Sep-2019.)

Assertion

Ref	Expression
reldmevls1	⊢ Rel dom evalSub1

Proof of Theorem reldmevls1

Dummy variables 𝑟 𝑏 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-evls1 22688	. 2 ⊢ evalSub1 = (𝑠 ∈ V, 𝑟 ∈ 𝒫 (Base‘𝑠) ↦ ⦋(Base‘𝑠) / 𝑏⦌((𝑥 ∈ (𝑏 ↑m (𝑏 ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ 𝑏 ↦ (1o × {𝑦})))) ∘ ((1o evalSub 𝑠)‘𝑟)))
2	1	reldmmpo 7584	1 ⊢ Rel dom evalSub1

This proof depends on syntax axioms:  Vcvv 3454  ⦋csb 3851  𝒫 cpw 4560  {csn 4588   ↦ cmpt 5192   × cxp 5656  dom cdm 5658   ∘ ccom 5662  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451  1_oc1o 8507   ↑_m cmap 8885  Basecbs 17431   evalSub ces 22436   evalSub₁ ces1 22686

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-dm 5668  df-oprab 7455  df-mpo 7456  df-evls1 22688

This theorem is used by:  evl1fval1  22704