internlm/Lean-Github huggingface dataset:
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr.left
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ ∃ a ∈ M_0.symbol_arrow_list,
    a.start_state = p_0 ∧ a.symbol = c ∧ List.map Sum.inl a.stop_state_list = List.map Sum.inl xs
Tactic:
apply Exists.intro { start_state := p_0, symbol := c, stop_state_list := xs }
Proof state after:
case mpr.left
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list ∧
    { start_state := p_0, symbol := c, stop_state_list := xs }.start_state = p_0 ∧
      { start_state := p_0, symbol := c, stop_state_list := xs }.symbol = c ∧
        List.map Sum.inl { start_state := p_0, symbol := c, stop_state_list := xs }.stop_state_list =
          List.map Sum.inl xs
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr.left
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list ∧
    { start_state := p_0, symbol := c, stop_state_list := xs }.start_state = p_0 ∧
      { start_state := p_0, symbol := c, stop_state_list := xs }.symbol = c ∧
        List.map Sum.inl { start_state := p_0, symbol := c, stop_state_list := xs }.stop_state_list =
          List.map Sum.inl xs
Tactic:
simp
Proof state after:
case mpr.left
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr.left
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
Tactic:
exact x
Proof state after:
no goals
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr.right
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ Sum.inl q_0 ∈ List.map Sum.inl xs
Tactic:
simp
Proof state after:
case mpr.right
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ q_0 ∈ xs
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr.right
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 q_0 : σ_0
xs : List σ_0
x : { start_state := p_0, symbol := c, stop_state_list := xs } ∈ M_0.symbol_arrow_list
a1 : q_0 ∈ xs
⊢ q_0 ∈ xs
Tactic:
exact a1
Proof state after:
no goals
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
⊢ (∃ stop_state_list,
      { start_state := Sum.inl p_0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inr q0 ∈ stop_state_list) =
    match (Sum.inl p_0, Sum.inr q0) with
    | (Sum.inl p', Sum.inl q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_0.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | (Sum.inr p', Sum.inr q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | x => False
Tactic:
simp
Proof state after:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
⊢ ∀ (x : List (σ_0 ⊕ σ_1)),
    ∀ x_1 ∈ M_0.symbol_arrow_list,
      x_1.start_state = p_0 → x_1.symbol = c → List.map Sum.inl x_1.stop_state_list = x → Sum.inr q0 ∉ x
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
⊢ ∀ (x : List (σ_0 ⊕ σ_1)),
    ∀ x_1 ∈ M_0.symbol_arrow_list,
      x_1.start_state = p_0 → x_1.symbol = c → List.map Sum.inl x_1.stop_state_list = x → Sum.inr q0 ∉ x
Tactic:
intro xs x _ _ _ a4
Proof state after:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_0
a✝² : x ∈ M_0.symbol_arrow_list
a✝¹ : x.start_state = p_0
a✝ : x.symbol = c
a4 : List.map Sum.inl x.stop_state_list = xs
⊢ Sum.inr q0 ∉ xs
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_0
a✝² : x ∈ M_0.symbol_arrow_list
a✝¹ : x.start_state = p_0
a✝ : x.symbol = c
a4 : List.map Sum.inl x.stop_state_list = xs
⊢ Sum.inr q0 ∉ xs
Tactic:
simp only [← a4]
Proof state after:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_0
a✝² : x ∈ M_0.symbol_arrow_list
a✝¹ : x.start_state = p_0
a✝ : x.symbol = c
a4 : List.map Sum.inl x.stop_state_list = xs
⊢ Sum.inr q0 ∉ List.map Sum.inl x.stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p_0 : σ_0
q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_0
a✝² : x ∈ M_0.symbol_arrow_list
a✝¹ : x.start_state = p_0
a✝ : x.symbol = c
a4 : List.map Sum.inl x.stop_state_list = xs
⊢ Sum.inr q0 ∉ List.map Sum.inl x.stop_state_list
Tactic:
simp
Proof state after:
no goals
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list) =
    match (Sum.inr p0, Sum.inl q_0) with
    | (Sum.inl p', Sum.inl q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_0.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | (Sum.inr p', Sum.inr q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | x => False
Tactic:
simp only [eq_iff_iff]
Proof state after:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list) ↔
    False
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list) ↔
    False
Tactic:
constructor
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list) →
    False

case mpr
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ False →
    ∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list) →
    False
Tactic:
simp
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ ∀ (x : List (σ_0 ⊕ σ_1)),
    ∀ x_1 ∈ M_1.symbol_arrow_list,
      x_1.start_state = p0 → x_1.symbol = c → List.map Sum.inr x_1.stop_state_list = x → Sum.inl q_0 ∉ x
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ ∀ (x : List (σ_0 ⊕ σ_1)),
    ∀ x_1 ∈ M_1.symbol_arrow_list,
      x_1.start_state = p0 → x_1.symbol = c → List.map Sum.inr x_1.stop_state_list = x → Sum.inl q_0 ∉ x
Tactic:
intro xs x _ _ _ a4
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_1
a✝² : x ∈ M_1.symbol_arrow_list
a✝¹ : x.start_state = p0
a✝ : x.symbol = c
a4 : List.map Sum.inr x.stop_state_list = xs
⊢ Sum.inl q_0 ∉ xs
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_1
a✝² : x ∈ M_1.symbol_arrow_list
a✝¹ : x.start_state = p0
a✝ : x.symbol = c
a4 : List.map Sum.inr x.stop_state_list = xs
⊢ Sum.inl q_0 ∉ xs
Tactic:
simp only [← a4]
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_1
a✝² : x ∈ M_1.symbol_arrow_list
a✝¹ : x.start_state = p0
a✝ : x.symbol = c
a4 : List.map Sum.inr x.stop_state_list = xs
⊢ Sum.inl q_0 ∉ List.map Sum.inr x.stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
xs : List (σ_0 ⊕ σ_1)
x : SymbolArrow α σ_1
a✝² : x ∈ M_1.symbol_arrow_list
a✝¹ : x.start_state = p0
a✝ : x.symbol = c
a4 : List.map Sum.inr x.stop_state_list = xs
⊢ Sum.inl q_0 ∉ List.map Sum.inr x.stop_state_list
Tactic:
simp
Proof state after:
no goals
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mpr
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 : σ_1
q_0 : σ_0
⊢ False →
    ∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inl q_0 ∈ stop_state_list
Tactic:
simp
Proof state after:
no goals
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      { start_state := Sum.inr p0, symbol := c, stop_state_list := stop_state_list } ∈
          List.map
              (fun arrow =>
                { start_state := Sum.inl arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inl arrow.stop_state_list })
              M_0.symbol_arrow_list ++
            List.map
              (fun arrow =>
                { start_state := Sum.inr arrow.start_state, symbol := arrow.symbol,
                  stop_state_list := List.map Sum.inr arrow.stop_state_list })
              M_1.symbol_arrow_list ∧
        Sum.inr q0 ∈ stop_state_list) =
    match (Sum.inr p0, Sum.inr q0) with
    | (Sum.inl p', Sum.inl q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_0.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | (Sum.inr p', Sum.inr q') =>
      ∃ stop_state_list,
        { start_state := p', symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
          q' ∈ stop_state_list
    | x => False
Tactic:
simp
Proof state after:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      (∃ a ∈ M_1.symbol_arrow_list,
          a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
        Sum.inr q0 ∈ stop_state_list) ↔
    ∃ stop_state_list,
      { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
        q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      (∃ a ∈ M_1.symbol_arrow_list,
          a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
        Sum.inr q0 ∈ stop_state_list) ↔
    ∃ stop_state_list,
      { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
        q0 ∈ stop_state_list
Tactic:
constructor
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      (∃ a ∈ M_1.symbol_arrow_list,
          a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
        Sum.inr q0 ∈ stop_state_list) →
    ∃ stop_state_list,
      { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
        q0 ∈ stop_state_list

case mpr
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
        q0 ∈ stop_state_list) →
    ∃ stop_state_list,
      (∃ a ∈ M_1.symbol_arrow_list,
          a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
        Sum.inr q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
⊢ (∃ stop_state_list,
      (∃ a ∈ M_1.symbol_arrow_list,
          a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
        Sum.inr q0 ∈ stop_state_list) →
    ∃ stop_state_list,
      { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
        q0 ∈ stop_state_list
Tactic:
intro a1
Proof state after:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
a1 :
  ∃ stop_state_list,
    (∃ a ∈ M_1.symbol_arrow_list,
        a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
      Sum.inr q0 ∈ stop_state_list
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
case mp
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
a1 :
  ∃ stop_state_list,
    (∃ a ∈ M_1.symbol_arrow_list,
        a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = stop_state_list) ∧
      Sum.inr q0 ∈ stop_state_list
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Tactic:
cases a1
Proof state after:
case mp.intro
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
w✝ : List (σ_0 ⊕ σ_1)
h✝ :
  (∃ a ∈ M_1.symbol_arrow_list, a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = w✝) ∧
    Sum.inr q0 ∈ w✝
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
a2 :
  (∃ a ∈ M_1.symbol_arrow_list, a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = xs) ∧
    Sum.inr q0 ∈ xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Tactic:
cases a2
Proof state after:
case intro
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
left✝ : ∃ a ∈ M_1.symbol_arrow_list, a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = xs
right✝ : Sum.inr q0 ∈ xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
a2_left : ∃ a ∈ M_1.symbol_arrow_list, a.start_state = p0 ∧ a.symbol = c ∧ List.map Sum.inr a.stop_state_list = xs
a2_right : Sum.inr q0 ∈ xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Tactic:
cases a2_left
Proof state after:
case intro
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
a2_right : Sum.inr q0 ∈ xs
w✝ : SymbolArrow α σ_1
h✝ : w✝ ∈ M_1.symbol_arrow_list ∧ w✝.start_state = p0 ∧ w✝.symbol = c ∧ List.map Sum.inr w✝.stop_state_list = xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Theorem: match_union_EpsilonNFA_toAbstract
Proof state before:
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
a2_right : Sum.inr q0 ∈ xs
x : SymbolArrow α σ_1
a3 : x ∈ M_1.symbol_arrow_list ∧ x.start_state = p0 ∧ x.symbol = c ∧ List.map Sum.inr x.stop_state_list = xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list
Tactic:
cases a3
Proof state after:
case intro
α : Type
inst✝ : DecidableEq α
σ_0 σ_1 : Type
M_0 : EpsilonNFA α σ_0
M_1 : EpsilonNFA α σ_1
c : α
p0 q0 : σ_1
xs : List (σ_0 ⊕ σ_1)
a2_right : Sum.inr q0 ∈ xs
x : SymbolArrow α σ_1
left✝ : x ∈ M_1.symbol_arrow_list
right✝ : x.start_state = p0 ∧ x.symbol = c ∧ List.map Sum.inr x.stop_state_list = xs
⊢ ∃ stop_state_list,
    { start_state := p0, symbol := c, stop_state_list := stop_state_list } ∈ M_1.symbol_arrow_list ∧
      q0 ∈ stop_state_list