Theorem: Matroid.SkewFamily.disjoint_of_indep_subset (Matroid/Modular.lean)

State before:
ι : Type u_1
α : Type u_2
M : Matroid α
B I J X X' Y Y' F : Set α
Xs Ys Js Is : ι → Set α
i j : ι
e f : α
h : M.SkewFamily Xs
hI : M.Indep I
hIX : I ⊆ Xs i
hij : i ≠ j
⊢ Disjoint I (Xs j)
Tactic:
have hdj := h.disjoint_inter_indep hI hij
State after:
ι : Type u_1
α : Type u_2
M : Matroid α
B I J X X' Y Y' F : Set α
Xs Ys Js Is : ι → Set α
i j : ι
e f : α
h : M.SkewFamily Xs
hI : M.Indep I
hIX : I ⊆ Xs i
hij : i ≠ j
hdj : Disjoint (Xs i ∩ I) (Xs j)
⊢ Disjoint I (Xs j)

State before:
ι : Type u_1
α : Type u_2
M : Matroid α
B I J X X' Y Y' F : Set α
Xs Ys Js Is : ι → Set α
i j : ι
e f : α
h : M.SkewFamily Xs
hI : M.Indep I
hIX : I ⊆ Xs i
hij : i ≠ j
hdj : Disjoint (Xs i ∩ I) (Xs j)
⊢ Disjoint I (Xs j)
Tactic:
rwa [inter_eq_self_of_subset_right hIX] at hdj
State after:
no goals