Theorem: Matroid.relRank_eq_union_right (Matroid/Minor/Rank.lean)

State before:
α : Type u_1
M✝ N : Matroid α
I J C D X✝ Y✝ Z : Set α
e f : α
M : Matroid α
X Y : Set α
⊢ M.relRank X Y = M.relRank X (Y ∪ X)
Tactic:
rw [eq_comm, relRank_eq_diff_right, union_diff_right, ← relRank_eq_diff_right]
State after:
no goals