Theorem reldmevls1 22647

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

This proof depends on syntax axioms:  Vcvv 3453  ⦋csb 3850  𝒫 cpw 4559  {csn 4587   ↦ cmpt 5188   × cxp 5652  dom cdm 5654   ∘ ccom 5658  Rel wrel 5659  ‘cfv 6546  (class class class)co 7427  1_oc1o 8480   ↑_m cmap 8858  Basecbs 17399   evalSub ces 22393   evalSub₁ ces1 22643

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394

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 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-dm 5664  df-oprab 7431  df-mpo 7432  df-evls1 22645

This theorem is used by:  evl1fval1  22661