Theorem: Execution.Step.Apply.RTC.deterministic (ReactorModel/Execution/Theorems/Step/Apply.lean)

State before:
α : Type
inst✝ : Readable α
s s₁ s₂ : State α
out : Reaction.Output
e₁ : s -[out]→ s₁
e₂ : s -[out]→ s₂
⊢ s₁ = s₂
Tactic:
induction e₁ generalizing s₂ <;> cases e₂
State after:
case refl.refl
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
s✝ : State α
⊢ s✝ = s✝

case trans.trans
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
hd✝ : Change
s₁✝ s₂✝¹ : State α
tl✝ : Reaction.Output
s₃✝ : State α
a✝³ : s₁✝ -[hd✝]→ s₂✝¹
a✝² : s₂✝¹ -[tl✝]→ s₃✝
a_ih✝ : ∀ {s₂ : State α}, s₂✝¹ -[tl✝]→ s₂ → s₃✝ = s₂
s₂ s₂✝ : State α
a✝¹ : s₁✝ -[hd✝]→ s₂✝
a✝ : s₂✝ -[tl✝]→ s₂
⊢ s₃✝ = s₂

State before:
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
s✝ : State α
⊢ s✝ = s✝
Tactic:
case refl.refl => rfl
State after:
no goals

State before:
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
hd✝ : Change
s₁✝ s₂✝¹ : State α
tl✝ : Reaction.Output
s₃✝ : State α
e₁ : s₁✝ -[hd✝]→ s₂✝¹
a✝ : s₂✝¹ -[tl✝]→ s₃✝
hi : ∀ {s₂ : State α}, s₂✝¹ -[tl✝]→ s₂ → s₃✝ = s₂
s₂ s₂✝ : State α
e₂ : s₁✝ -[hd✝]→ s₂✝
e₂' : s₂✝ -[tl✝]→ s₂
⊢ s₃✝ = s₂
Tactic:
case trans.trans e₁ _ hi _ e₂ e₂' => exact hi $ (e₁.deterministic e₂) ▸ e₂'
State after:
no goals

State before:
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
s✝ : State α
⊢ s✝ = s✝
Tactic:
rfl
State after:
no goals

State before:
α : Type
inst✝ : Readable α
s s₁ : State α
out : Reaction.Output
hd✝ : Change
s₁✝ s₂✝¹ : State α
tl✝ : Reaction.Output
s₃✝ : State α
e₁ : s₁✝ -[hd✝]→ s₂✝¹
a✝ : s₂✝¹ -[tl✝]→ s₃✝
hi : ∀ {s₂ : State α}, s₂✝¹ -[tl✝]→ s₂ → s₃✝ = s₂
s₂ s₂✝ : State α
e₂ : s₁✝ -[hd✝]→ s₂✝
e₂' : s₂✝ -[tl✝]→ s₂
⊢ s₃✝ = s₂
Tactic:
exact hi $ (e₁.deterministic e₂) ▸ e₂'
State after:
no goals