Theorem: Matroid.Minor.strictMinor_or_eq (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
⊢ N <m M ∨ N = M
Tactic:
rw [strictMinor_iff_minor_ne, and_iff_right h]
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
⊢ N ≠ M ∨ N = M

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
⊢ N ≠ M ∨ N = M
Tactic:
exact ne_or_eq N M
State after:
no goals