Theorem s5cld

Description: A length 5 string is a word. (Contributed by Mario Carneiro, 27-Feb-2016)

	Ref	Expression
Hypotheses	s2cld.1	|- ( ph -> A e. X )
	s2cld.2	|- ( ph -> B e. X )
	s3cld.3	|- ( ph -> C e. X )
	s4cld.4	|- ( ph -> D e. X )
	s5cld.5	|- ( ph -> E e. X )
Assertion	s5cld	|- ( ph -> <" A B C D E "> e. Word X )

Proof

Step	Hyp	Ref	Expression
1		s2cld.1	|- ( ph -> A e. X )
2		s2cld.2	|- ( ph -> B e. X )
3		s3cld.3	|- ( ph -> C e. X )
4		s4cld.4	|- ( ph -> D e. X )
5		s5cld.5	|- ( ph -> E e. X )
6		df-s5	|- <" A B C D E "> = ( <" A B C D "> ++ <" E "> )
7	1 2 3 4	s4cld	|- ( ph -> <" A B C D "> e. Word X )
8	6 7 5	cats1cld	|- ( ph -> <" A B C D E "> e. Word X )