Theorem: LoVe.RTC.trans (LoVe/LoVelib.lean)

State before:
α : Type
R : α → α → Prop
a b c : α
hab : RTC R a b
hbc : RTC R b c
⊢ RTC R a c
Tactic:
induction hbc with
| refl =>
  assumption
| tail c d hbc hcd hac =>
  apply tail <;>
    assumption
State after:
no goals

State before:
case refl
α : Type
R : α → α → Prop
a b c : α
hab : RTC R a b
⊢ RTC R a b
Tactic:
assumption
State after:
no goals

State before:
case tail
α : Type
R : α → α → Prop
a b c✝ : α
hab : RTC R a b
c d : α
hbc : RTC R b c
hcd : R c d
hac : RTC R a c
⊢ RTC R a d
Tactic:
apply tail <;>
  assumption
State after:
no goals