Metamath Proof Explorer

Theorem s5cli

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

Ref Expression
Assertion s5cli 
|- <" A B C D E "> e. Word _V

Proof

Step Hyp Ref Expression
1 df-s5 
 |-  <" A B C D E "> = ( <" A B C D "> ++ <" E "> )
2 s4cli 
 |-  <" A B C D "> e. Word _V
3 1 2 cats1cli 
 |-  <" A B C D E "> e. Word _V