congr
case a.x
n : Nat
s : Setoid (Fin n)
inst✝ : DecidableRel Setoid.r
i✝ j✝ : Subtype (repr s)
i : Fin n
hri : (Fin.find? fun b => decide (Setoid.r i b)) = some i
j : Fin n
hrj : (Fin.find? fun b => decide (Setoid.r j b)) = some j
hij : Setoid.r ⟨i, hri⟩.val ⟨j, hrj⟩.val
⊢ (Fin.find? fun b => decide (Setoid.r i b)) = Fin.find? fun b => decide (Setoid.r j b)
case a.x.e_p
n : Nat
s : Setoid (Fin n)
inst✝ : DecidableRel Setoid.r
i✝ j✝ : Subtype (repr s)
i : Fin n
hri : (Fin.find? fun b => decide (Setoid.r i b)) = some i
j : Fin n
hrj : (Fin.find? fun b => decide (Setoid.r j b)) = some j
hij : Setoid.r ⟨i, hri⟩.val ⟨j, hrj⟩.val
⊢ (fun b => decide (Setoid.r i b)) = fun b => decide (Setoid.r j b)