Rank | Theorem | Name |
6 |
Thm* E:EventStruct, P:((Label![](FONT/dash.png) (|E| List))![](FONT/dash.png) Prop).
( f,g:(Label![](FONT/dash.png) (|E| List)). ( p:Label. g(p) f(p)) ![](FONT/eq.png) P(f) ![](FONT/eq.png) P(g)) ![](FONT/eq.png)
( f,g:(Label![](FONT/dash.png) (|E| List)).
( a:|E|. p:Label. g(p) = filter( b.![](FONT/not.png) (b =msg=(E) a);f(p))) ![](FONT/eq.png) P(f) ![](FONT/eq.png) P(g))
![](FONT/eq.png)
( f,g,h:(Label![](FONT/dash.png) (|E| List)).
( p,q:Label. ( x f(p).( y g(q). (x =msg=(E) y)))) ![](FONT/eq.png)
( p:Label. h(p) = ((f(p)) @ (g(p)))) ![](FONT/eq.png) P(f) ![](FONT/eq.png) P(g) ![](FONT/eq.png) P(h))
![](FONT/eq.png)
switchable0(E)(local_deliver_property(E;P)) | [local_deliver_switchable] |
cites |
0 |
Thm* P:(T![](FONT/dash.png) ![](FONT/then_med.png) ), L2,L1:T List. L1 L2 ![](FONT/eq.png) filter(P;L1) filter(P;L2) | [filter_iseg] |
0 |
Thm* as:T List. (as @ nil) = as | [append_back_nil] |
0 |
Thm* P:(T![](FONT/dash.png) ![](FONT/then_med.png) ), L:T List. ( x filter(P;L).P(x)) | [l_all_filter] |
5 |
Thm* P:(A![](FONT/dash.png) A![](FONT/dash.png) Prop), f:(A![](FONT/dash.png) ![](FONT/then_med.png) ), L1,L2:A List.
(L1 swap adjacent[P(x,y)] L2) ![](FONT/eq.png)
(filter(f;L1) swap adjacent[P(x,y)] filter(f;L2)) filter(f;L1) = filter(f;L2) | [filter_swap_adjacent] |