Theorem reldmevls1 21532

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 21530	. 2 ⊢ evalSub1 = (𝑠 ∈ V, 𝑟 ∈ 𝒫 (Base‘𝑠) ↦ ⦋(Base‘𝑠) / 𝑏⦌((𝑥 ∈ (𝑏 ↑m (𝑏 ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ 𝑏 ↦ (1o × {𝑦})))) ∘ ((1o evalSub 𝑠)‘𝑟)))
2	1	reldmmpo 7440	1 ⊢ Rel dom evalSub1

Syntax hints:  Vcvv 3437  ⦋csb 3837  𝒫 cpw 4539  {csn 4565   ↦ cmpt 5164   × cxp 5598  dom cdm 5600   ∘ ccom 5604  Rel wrel 5605  ‘cfv 6458  (class class class)co 7307  1_oc1o 8321   ↑_m cmap 8646  Basecbs 16961   evalSub ces 21329   evalSub₁ ces1 21528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-sep 5232  ax-nul 5239  ax-pr 5361

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-rab 3333  df-v 3439  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4566  df-pr 4568  df-op 4572  df-br 5082  df-opab 5144  df-xp 5606  df-rel 5607  df-dm 5610  df-oprab 7311  df-mpo 7312  df-evls1 21530

This theorem is referenced by:  evl1fval1  21546