Definition df-word

Description: Define the class ofwords over a set. A word (sometimes also called a string) is a finite sequence of symbols from a set (alphabet) S . Definition in Section 9.1 of AhoHopUll p. 318. The domain is forced to be an initial segment of NN0 so that two words with the same symbols in the same order be equal. The set Word S is sometimes denoted by S*, using the Kleene star, although the Kleene star, or Kleene closure, is sometimes reserved to denote an operation on languages. The set Word S equipped with concatenation is the free monoid over S , and the monoid unit is the empty word (see frmdval ). (Contributed by FL, 14-Jan-2014) (Revised by Stefan O'Rear, 14-Aug-2015) (Revised by Mario Carneiro, 26-Feb-2016)

	Ref	Expression
Assertion	df-word	$$⊢\mathrm{Word}S=\left\{w|\exists l\in {\mathbb{N}}_{0}w:\left(0..^l\right)⟶S\right\}$$

Detailed syntax breakdown

Step	Hyp	Ref	Expression
0		cS	$$classS$$
1	0	cword	$$class\mathrm{Word}S$$
2		vw	$$setvarw$$
3		vl	$$setvarl$$
4		cn0	$$class{\mathbb{N}}_0$$
5	2	cv	$$setvarw$$
6		cc0	$$class0$$
7		cfzo	$$class..^$$
8	3	cv	$$setvarl$$
9	6 8 7	co	$$class\left(0..^l\right)$$
10	9 0 5	wf	$$wffw:\left(0..^l\right)⟶S$$
11	10 3 4	wrex	$$wff\exists l\in {\mathbb{N}}_{0}w:\left(0..^l\right)⟶S$$
12	11 2	cab	$$class\left\{w|\exists l\in {\mathbb{N}}_{0}w:\left(0..^l\right)⟶S\right\}$$
13	1 12	wceq	$$wff\mathrm{Word}S=\left\{w|\exists l\in {\mathbb{N}}_{0}w:\left(0..^l\right)⟶S\right\}$$