Theorem wwlkssswwlksn

Description: The walks of a fixed length as words are walks (in an undirected graph) as words. (Contributed by Alexander van der Vekens, 17-Jul-2018) (Revised by AV, 12-Apr-2021)

	Ref	Expression
Assertion	wwlkssswwlksn	|- ( N WWalksN G ) C_ ( WWalks ` G )

Proof

Step	Hyp	Ref	Expression
1		wwlkswwlksn	|- ( w e. ( N WWalksN G ) -> w e. ( WWalks ` G ) )
2	1	ssriv	|- ( N WWalksN G ) C_ ( WWalks ` G )