-- Mathlib/.lake/packages/batteries/Batteries/Data/List/Lemmas.lean
theorem dropInfix?_go_eq_some_iff [BEq α] {i l acc p s : List α} :
    dropInfix?.go i l acc = some (p, s) ↔ ∃ p',
      p = acc.reverse ++ p' ∧
      -- `i` is an infix up to `==`
      (∃ i', l = p' ++ i' ++ s ∧ i' == i) ∧
        -- and there is no shorter prefix for which that is the case
        (∀ p'' i'' s'', l = p'' ++ i'' ++ s'' → i'' == i → p''.length ≥ p'.length)

Proof state:
case h_2.h_1.mp.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ ∃ p'_1,
    (a :: acc).reverse ++ p' = acc.reverse ++ p'_1 ∧
      (∃ i'_1, a :: (p' ++ i' ++ s) = p'_1 ++ i'_1 ++ s ∧ (i'_1 == i) = true) ∧
        ∀ (p'' i'' s'' : List α),
          a :: (p' ++ i' ++ s) = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'_1.length

Tactic:
refine ⟨a :: p', ?_⟩

Result:
case h_2.h_1.mp.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ (a :: acc).reverse ++ p' = acc.reverse ++ a :: p' ∧
    (∃ i'_1, a :: (p' ++ i' ++ s) = a :: p' ++ i'_1 ++ s ∧ (i'_1 == i) = true) ∧
      ∀ (p'' i'' s'' : List α),
        a :: (p' ++ i' ++ s) = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ (a :: p').length

Proof state:
case h_2.h_1.mp.intro.intro.intro.intro.intro.inr.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂✝ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
i'' s'' : List α
h₂ : (i'' == i) = true
p'' : List α
h₁ : p' ++ (i' ++ s) = p'' ++ (i'' ++ s'')
⊢ p'.length + 1 ≤ (a :: p'').length

Tactic:
simpa using w p'' i'' s'' (by simpa using h₁) h₂

Result:
no goals

Proof state:
case h_2.h_1.mpr.intro.intro.intro.intro.intro.inr.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
a' : List α
h₁ : p' ++ i' = a :: a'
h : (a :: (a' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), a :: (a' ++ s) = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ ∃ p'_1,
    acc.reverse ++ p' = (a :: acc).reverse ++ p'_1 ∧
      (∃ i', a' ++ s = p'_1 ++ i' ++ s ∧ (i' == i) = true) ∧
        ∀ (p'' i'' s'' : List α), a' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'_1.length

Tactic:
rw [append_eq_cons_iff] at h₁

Result:
case h_2.h_1.mpr.intro.intro.intro.intro.intro.inr.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
a' : List α
h₁ : p' = [] ∧ i' = a :: a' ∨ ∃ a'_1, p' = a :: a'_1 ∧ a' = a'_1 ++ i'
h : (a :: (a' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), a :: (a' ++ s) = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ ∃ p'_1,
    acc.reverse ++ p' = (a :: acc).reverse ++ p'_1 ∧
      (∃ i', a' ++ s = p'_1 ++ i' ++ s ∧ (i' == i) = true) ∧
        ∀ (p'' i'' s'' : List α), a' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'_1.length

Proof state:
case h_2.h_2.intro.intro.mpr.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
t : List α
x✝ : Option (List α)
s' p' : List α
h : a :: t = p' ++ s'
w : (p' == i) = true
p'' i' : List α
h₂ : (i' == i) = true
w' : p'' = []
h₁ : p' ++ s' = i' ++ s
⊢ s' = s

Tactic:
apply append_inj_right h₁

Result:
case h_2.h_2.intro.intro.mpr.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
t : List α
x✝ : Option (List α)
s' p' : List α
h : a :: t = p' ++ s'
w : (p' == i) = true
p'' i' : List α
h₂ : (i' == i) = true
w' : p'' = []
h₁ : p' ++ s' = i' ++ s
⊢ p'.length = i'.length

Proof state:
case h_2.h_1.mp.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ (a :: acc).reverse ++ p' = acc.reverse ++ a :: p' ∧
    (∃ i'_1, a :: (p' ++ i' ++ s) = a :: p' ++ i'_1 ++ s ∧ (i'_1 == i) = true) ∧
      ∀ (p'' i'' s'' : List α),
        a :: (p' ++ i' ++ s) = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ (a :: p').length

Tactic:
simp [h₂]

Result:
case h_2.h_1.mp.intro.intro.intro.intro.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
⊢ ∀ (p'' i'' s'' : List α),
    a :: (p' ++ (i' ++ s)) = p'' ++ (i'' ++ s'') → (i'' == i) = true → p'.length + 1 ≤ p''.length

Proof state:
case h_2.h_2
α : Type u_1
inst✝ : BEq α
i acc p s x✝² x✝¹ : List α
a : α
t : List α
x✝ : Option (List α)
s✝ : List α
h : (a :: t).dropPrefix? i = some s✝
⊢ some (acc.reverse, s✝) = some (p, s) ↔
    ∃ p',
      p = acc.reverse ++ p' ∧
        (∃ i', a :: t = p' ++ i' ++ s ∧ (i' == i) = true) ∧
          ∀ (p'' i'' s'' : List α), a :: t = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length

Tactic:
rename_i s'

Result:
case h_2.h_2
α : Type u_1
inst✝ : BEq α
i acc p s x✝² x✝¹ : List α
a : α
t : List α
x✝ : Option (List α)
s' : List α
h : (a :: t).dropPrefix? i = some s'
⊢ some (acc.reverse, s') = some (p, s) ↔
    ∃ p',
      p = acc.reverse ++ p' ∧
        (∃ i', a :: t = p' ++ i' ++ s ∧ (i' == i) = true) ∧
          ∀ (p'' i'' s'' : List α), a :: t = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length

Proof state:
case h_2.h_1.mpr.intro.intro.intro.intro.intro.inl.intro.intro
α : Type u_1
inst✝ : BEq α
i acc x✝² x✝¹ : List α
a : α
t : List α
x✝ : Option (List α)
w : ∀ (p'' i'' s'' : List α), a :: t = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ [].length
h₂ : i = []
h : (a :: t).dropPrefix? [] = none
⊢ ∃ p',
    acc.reverse ++ [] = (a :: acc).reverse ++ p' ∧
      (∃ i', t = p' ++ i' ++ a :: t ∧ (i' == i) = true) ∧
        ∀ (p'' i'' s'' : List α), t = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length

Tactic:
simp at h

Result:
no goals

Proof state:
case h_2.h_1.mp.intro.intro.intro.intro.intro.inl.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂✝ : (i' == i) = true
h : (a :: (p' ++ i' ++ s)).dropPrefix? i = none
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
i'' s'' : List α
h₂ : (i'' == i) = true
h₁ : i'' ++ s'' = a :: (p' ++ (i' ++ s))
⊢ p'.length + 1 ≤ [].length

Tactic:
rw [append_assoc, ← h₁] at h

Result:
case h_2.h_1.mp.intro.intro.intro.intro.intro.inl.intro
α : Type u_1
inst✝ : BEq α
i acc s x✝² x✝¹ : List α
a : α
x✝ : Option (List α)
p' i' : List α
h₂✝ : (i' == i) = true
w : ∀ (p'' i'' s'' : List α), p' ++ i' ++ s = p'' ++ i'' ++ s'' → (i'' == i) = true → p''.length ≥ p'.length
i'' s'' : List α
h : (i'' ++ s'').dropPrefix? i = none
h₂ : (i'' == i) = true
h₁ : i'' ++ s'' = a :: (p' ++ (i' ++ s))
⊢ p'.length + 1 ≤ [].length