Theorem reldmevls1 22527

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

This proof depends on syntax axioms:  Vcvv 3457  ⦋csb 3854  𝒫 cpw 4564  {csn 4591   ↦ cmpt 5194   × cxp 5661  dom cdm 5663   ∘ ccom 5667  Rel wrel 5668  ‘cfv 6540  (class class class)co 7419  1_oc1o 8452   ↑_m cmap 8830  Basecbs 17291   evalSub ces 22273   evalSub₁ ces1 22523

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 2737  ax-sep 5259  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-dm 5673  df-oprab 7423  df-mpo 7424  df-evls1 22525

This theorem is used by:  evl1fval1  22541