Theorem: SimpleGraph.mp_deg (Turan4/Multipartite.lean)

State before:
α : Type u_1
inst✝¹ : Fintype α
inst✝ : DecidableEq α
i : ℕ
v : α
M : MultiPart α
hv : i ∈ range (M.t + 1) ∧ v ∈ MultiPart.P M i
⊢ degree (mp M) v = card (M.A \ MultiPart.P M i)
Tactic:
rw [degree]
State after:
α : Type u_1
inst✝¹ : Fintype α
inst✝ : DecidableEq α
i : ℕ
v : α
M : MultiPart α
hv : i ∈ range (M.t + 1) ∧ v ∈ MultiPart.P M i
⊢ card (neighborFinset (mp M) v) = card (M.A \ MultiPart.P M i)

State before:
α : Type u_1
inst✝¹ : Fintype α
inst✝ : DecidableEq α
i : ℕ
v : α
M : MultiPart α
hv : i ∈ range (M.t + 1) ∧ v ∈ MultiPart.P M i
⊢ card (neighborFinset (mp M) v) = card (M.A \ MultiPart.P M i)
Tactic:
rw [mp_nbhd hv]
State after:
no goals