MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-vrmd Structured version   Visualization version   Unicode version

Definition df-vrmd 17387
Description: Define a free monoid over a set  i of generators, defined as the set of finite strings on  I with the operation of concatenation. (Contributed by Mario Carneiro, 27-Sep-2015.)
Assertion
Ref Expression
df-vrmd  |- varFMnd  =  ( i  e. 
_V  |->  ( j  e.  i  |->  <" j "> ) )
Distinct variable group:    i, j

Detailed syntax breakdown of Definition df-vrmd
StepHypRef Expression
1 cvrmd 17385 . 2  class varFMnd
2 vi . . 3  setvar  i
3 cvv 3200 . . 3  class  _V
4 vj . . . 4  setvar  j
52cv 1482 . . . 4  class  i
64cv 1482 . . . . 5  class  j
76cs1 13294 . . . 4  class  <" j ">
84, 5, 7cmpt 4729 . . 3  class  ( j  e.  i  |->  <" j "> )
92, 3, 8cmpt 4729 . 2  class  ( i  e.  _V  |->  ( j  e.  i  |->  <" j "> ) )
101, 9wceq 1483 1  wff varFMnd  =  ( i  e. 
_V  |->  ( j  e.  i  |->  <" j "> ) )
Colors of variables: wff setvar class
This definition is referenced by:  vrmdfval  17393
  Copyright terms: Public domain W3C validator