clwwlkf1o

Description: F is a 1-1 onto function, that means that there is a bijection between the set of closed walks of a fixed length represented by walks (as words) and the set of closed walks (as words) of the fixed length. The difference between these two representations is that in the first case the starting vertex is repeated at the end of the word, and in the second case it is not. (Contributed by Alexander van der Vekens, 29-Sep-2018) (Revised by AV, 26-Apr-2021) (Revised by AV, 1-Nov-2022)

	Ref	Expression
Hypotheses	clwwlkf1o.d	$⊢ D = \{w \in (N WWalksN G) \| lastS (w) = w (0)\}$
	clwwlkf1o.f	$⊢ F = (t \in D ⟼ t prefix N)$
Assertion	clwwlkf1o	$⊢ N \in ℕ \to F : D \underset{1-1 onto}{⟶} N ClWWalksN G$

Proof

Step	Hyp	Ref	Expression
1		clwwlkf1o.d	$⊢ D = \{w \in (N WWalksN G) \| lastS (w) = w (0)\}$
2		clwwlkf1o.f	$⊢ F = (t \in D ⟼ t prefix N)$
3	1 2	clwwlkf1	$⊢ N \in ℕ \to F : D \underset{1-1}{⟶} N ClWWalksN G$
4	1 2	clwwlkfo	$⊢ N \in ℕ \to F : D \underset{onto}{⟶} N ClWWalksN G$
5		df-f1o	$⊢ F : D \underset{1-1 onto}{⟶} N ClWWalksN G \leftrightarrow (F : D \underset{1-1}{⟶} N ClWWalksN G \land F : D \underset{onto}{⟶} N ClWWalksN G)$
6	3 4 5	sylanbrc	$⊢ N \in ℕ \to F : D \underset{1-1 onto}{⟶} N ClWWalksN G$

Metamath Proof Explorer

Theorem clwwlkf1o

Proof