is mentioned by

Thm* M:sm{i:l}(), P:(M.state(M.action List)Prop). (M |= always s,t.P(s,t)) (M |= s,t.P(s,t) while True) & (M |= initially s,t.P(s,t))	[trace_inv_as_while]
Thm* M:sm{i:l}(), l1,l2:M.action List, s,s':M.state. trace_reachable(M;s;l1 @ l2;s') (x:M.state. trace_reachable(M;s;l1;x) & trace_reachable(M;x;l2;s'))	[trace_reachable_append]
Thm* M:sm{i:l}(), a:M.action, s,s':M.state. trace_reachable(M;s;[a];s') M.trans(s,a,s')	[trace_reachable_one]

In prior sections: core well fnd int 1 bool 1 fun 1 int 2 list 1 rel 1 mb basic mb nat num thy 1 mb list 1 mb label

Try larger context: GenAutomata