case intro
α : Type u
l✝ l' l : List α
k : ℕ
⊢ List.cyclicPermutations l ~r List.cyclicPermutations (rotate l k)
α : Type u
l✝ l'✝ l l' : List α
h : l ~r l'
⊢ List.cyclicPermutations l ~r List.cyclicPermutations l'
obtain ⟨k, rfl⟩ := h
no goals
case intro
α : Type u
l✝ l' l : List α
k : ℕ
⊢ List.cyclicPermutations l ~r List.cyclicPermutations (rotate l k)
exact ⟨k, by simp⟩
no goals
α : Type u
l✝ l' l : List α
k : ℕ
⊢ rotate (List.cyclicPermutations l) k = List.cyclicPermutations (rotate l k)
simp