Theorem: Matroid.Skew.cl_skew (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.Skew X Y
⊢ M.Skew (M.cl X) (M.cl Y)
Tactic:
have h' := SkewFamily.cls_skewFamily h
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.Skew X Y
h' : M.SkewFamily fun i => M.cl (bif i then X else Y)
⊢ M.Skew (M.cl X) (M.cl Y)

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.Skew X Y
h' : M.SkewFamily fun i => M.cl (bif i then X else Y)
⊢ M.Skew (M.cl X) (M.cl Y)
Tactic:
simp_rw [Bool.cond_eq_ite, apply_ite, ← Bool.cond_eq_ite] at h'
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.Skew X Y
h' : M.SkewFamily fun i => bif i then M.cl X else M.cl Y
⊢ M.Skew (M.cl X) (M.cl Y)

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.Skew X Y
h' : M.SkewFamily fun i => bif i then M.cl X else M.cl Y
⊢ M.Skew (M.cl X) (M.cl Y)
Tactic:
exact h'
State after:
no goals