Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-vrmd | Structured version Visualization version Unicode version |
Description: Define a free monoid over a set of generators, defined as the set of finite strings on with the operation of concatenation. (Contributed by Mario Carneiro, 27-Sep-2015.) |
Ref | Expression |
---|---|
df-vrmd | varFMnd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cvrmd 17385 | . 2 varFMnd | |
2 | vi | . . 3 | |
3 | cvv 3200 | . . 3 | |
4 | vj | . . . 4 | |
5 | 2 | cv 1482 | . . . 4 |
6 | 4 | cv 1482 | . . . . 5 |
7 | 6 | cs1 13294 | . . . 4 |
8 | 4, 5, 7 | cmpt 4729 | . . 3 |
9 | 2, 3, 8 | cmpt 4729 | . 2 |
10 | 1, 9 | wceq 1483 | 1 varFMnd |
Colors of variables: wff setvar class |
This definition is referenced by: vrmdfval 17393 |
Copyright terms: Public domain | W3C validator |