Proof using.
rewrite /step_star_lb_step_reachable.
move => net l.
move => net' tr tr' H_star H_st.
invcs H_st.
- set net' := {| odnwNodes := _ ; odnwPackets := _ ; odnwState := _ |}.
apply (@refl_trans_1n_trace_trans _ _ _ _ net) => //.
rewrite (app_nil_end (map2fst _ _)).
apply: (@RT1nTStep _ _ _ _ net'); last exact: RT1nTBase.
apply: (StepOrderedDynamic_deliver _ _ _ H0 H1) => //.
rewrite /net_handlers /= /unlabeled_net_handlers /=.
repeat break_let.
by tuple_inversion.
- set net' := {| odnwNodes := _ ; odnwPackets := _ ; odnwState := _ |}.
apply (@refl_trans_1n_trace_trans _ _ _ _ net) => //.
rewrite (app_nil_end (_ :: _)).
apply: (@RT1nTStep _ _ _ _ net'); last exact: RT1nTBase.
apply: (StepOrderedDynamic_input _ _ H0) => //.
rewrite /input_handlers /= /unlabeled_input_handlers /=.
repeat break_let.
by tuple_inversion.
- by have ->: tr' ++ [] = tr' by auto with datatypes.
Qed.

Lemma step_ordered_dynamic_star_lb_step_execution :
forall s, event_step_star step_ordered_dynamic step_ordered_dynamic_init (hd s) ->
lb_step_execution lb_step_ordered_dynamic s ->
always (now (event_step_star step_ordered_dynamic step_ordered_dynamic_init)) s.