Theorem: Matroid.Iso.on_indep_iff (Matroid/Old/_Equiv.lean)

State before:
α : Type u_1
β : Type u_2
γ : Type u_3
α₁ : Type u_4
α₂ : Type u_5
α₃ : Type u_6
M : Matroid α
N : Matroid β
B I D X Y : Set α
e : M.Iso N
hI : autoParam (I ⊆ M.E) _auto✝
⊢ M.Indep I ↔ N.Indep (↑e.toPartialEquiv '' I)
Tactic:
refine ⟨e.on_indep, fun h ↦ e.on_indep_symm h hI⟩
State after:
no goals