Theorem: Matroid.StrictMinor.C_union_D_nonempty (Matroid/Minor/Basic.lean)

State before:
α : Type u_1
M M' N : Matroid α
e f : α
I J R B X Y Z K : Set α
M₀ M₁ M₂ : Matroid α
h : N <m M
⊢ (⋯.C ∪ ⋯.D).Nonempty
Tactic:
rw [h.minor.C_union_D_eq]
State after:
α : Type u_1
M M' N : Matroid α
e f : α
I J R B X Y Z K : Set α
M₀ M₁ M₂ : Matroid α
h : N <m M
⊢ (M.E \ N.E).Nonempty

State before:
α : Type u_1
M M' N : Matroid α
e f : α
I J R B X Y Z K : Set α
M₀ M₁ M₂ : Matroid α
h : N <m M
⊢ (M.E \ N.E).Nonempty
Tactic:
exact nonempty_of_ssubset h.ssubset
State after:
no goals