Theorem reldmevls1 19682

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 r b s x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-evls1 19680	. 2 |- evalSub1 = ( s e. _V , r e. ~P ( Base ` s ) |-> [_ ( Base ` s ) / b ]_ ( ( x e. ( b ^m ( b ^m 1o ) ) |-> ( x o. ( y e. b |-> ( 1o X. { y } ) ) ) ) o. ( ( 1o evalSub s ) ` r ) ) )
2	1	reldmmpt2 6771	1 |- Rel dom evalSub1

Syntax hints:   _Vcvv 3200   [_csb 3533   ~Pcpw 4158   {csn 4177   |-> cmpt 4729   X. cxp 5112   dom cdm 5114   o. ccom 5118   Rel wrel 5119   ` cfv 5888  (class class class)co 6650   1oc1o 7553   ^m cmap 7857   Basecbs 15857   evalSub ces 19504   evalSub₁ ces1 19678

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-dm 5124  df-oprab 6654  df-mpt2 6655  df-evls1 19680

This theorem is referenced by:  evl1fval1  19695