Theorem: Vec.get_swap_right (QuickSortInLean/Vec.lean)

State before:
α : Type
n : Nat
a : Vec α n
i j : Fin n
⊢ (a.swap i j)[j] = a[i]
Tactic:
simp [Vec.swap_def, Vec.get_set_eq]
State after:
α : Type
n : Nat
a : Vec α n
i j : Fin n
⊢ a.get i = a[i]

State before:
α : Type
n : Nat
a : Vec α n
i j : Fin n
⊢ a.get i = a[i]
Tactic:
rfl
State after:
no goals