Step
*
1
1
2
1
1
2
1
of Lemma
std-components-property
1. [M] : Type ⟶ Type
2. Continuous+(P.M[P])
3. n2m : ℕ ⟶ pMsg(P.M[P])@i
4. x : Id@i
5. Q : Process(P.M[P])@i
6. l2m : Id ⟶ pMsg(P.M[P])@i
7. S2 : InitialSystem(P.M[P])@i
8. sub-system(P.M[P];<[<x, Q>], lg-nil()>;S2)
9. env : pEnvType(P.M[P])@i
10. ∀e1,e2:runEvents(pRun(S2;env;n2m;l2m)).
(∀P:Process(P.M[P])
((P ∈ run-prior-state(S2;pRun(S2;env;n2m;l2m);e1))
⇒ (iterate-Process(P;map(λe.run-event-msg(pRun(S2;env;n2m;l2m);e);
run-event-interval(pRun(S2;env;n2m;l2m);e1;e2)))
∈ run-event-state(pRun(S2;env;n2m;l2m);e2)))) supposing
((run-event-step(e1) ≤ run-event-step(e2)) and
(run-event-loc(e1) = run-event-loc(e2) ∈ Id))
11. pRun(S2;env;n2m;l2m) ∈ pRunType(P.M[P])
12. reliable-env(env; pRun(S2;env;n2m;l2m))@i
13. ∀e:runEvents(pRun(S2;env;n2m;l2m)). ∀P:Process(P.M[P]).
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd((P (snd(run-info(pRun(S2;env;n2m;l2m);e))))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':runEvents(pRun(S2;env;n2m;l2m))
((run-event-loc(e') = y ∈ Id)
∧ (e run-lt(pRun(S2;env;n2m;l2m)) e')
∧ (∃n:ℕ
∃nm:Id
((snd(run-info(pRun(S2;env;n2m;l2m);e')))
= command-to-msg(c;n2m n;l2m nm)
∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e')
= (inl e)
∈ (runEvents(pRun(S2;env;n2m;l2m))?)))))
14. E ⊆r runEvents(pRun(S2;env;n2m;l2m))
15. runEvents(pRun(S2;env;n2m;l2m)) ⊆r E
16. ∀e:runEvents(pRun(S2;env;n2m;l2m)). (loc(e) = run-event-loc(e) ∈ Id)
17. run-cause(pRun(S2;env;n2m;l2m)) ∈ E ⟶ (E?)
18. e : E@i
19. loc(e) = (fst(<x, Q>)) ∈ Id
20. ∀P:Process(P.M[P])
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd(P(info(e))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':E
((loc(e') = y ∈ Id)
∧ (e < e')
∧ (∃n:ℕ. ∃nm:Id. (info(e') = command-to-msg(c;n2m n;l2m nm) ∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e') = (inl e) ∈ (E?)))))
⊢ (iterate-Process(Q;map(λe.info(e);before(e))) ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
BY
{ (Thin (-4) THEN RecUnfold `es-before` 0 THEN AutoSplit) }
1
1. [M] : Type ⟶ Type
2. Continuous+(P.M[P])
3. n2m : ℕ ⟶ pMsg(P.M[P])@i
4. x : Id@i
5. Q : Process(P.M[P])@i
6. l2m : Id ⟶ pMsg(P.M[P])@i
7. S2 : InitialSystem(P.M[P])@i
8. sub-system(P.M[P];<[<x, Q>], lg-nil()>;S2)
9. env : pEnvType(P.M[P])@i
10. ∀e1,e2:runEvents(pRun(S2;env;n2m;l2m)).
(∀P:Process(P.M[P])
((P ∈ run-prior-state(S2;pRun(S2;env;n2m;l2m);e1))
⇒ (iterate-Process(P;map(λe.run-event-msg(pRun(S2;env;n2m;l2m);e);
run-event-interval(pRun(S2;env;n2m;l2m);e1;e2)))
∈ run-event-state(pRun(S2;env;n2m;l2m);e2)))) supposing
((run-event-step(e1) ≤ run-event-step(e2)) and
(run-event-loc(e1) = run-event-loc(e2) ∈ Id))
11. pRun(S2;env;n2m;l2m) ∈ pRunType(P.M[P])
12. reliable-env(env; pRun(S2;env;n2m;l2m))@i
13. ∀e:runEvents(pRun(S2;env;n2m;l2m)). ∀P:Process(P.M[P]).
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd((P (snd(run-info(pRun(S2;env;n2m;l2m);e))))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':runEvents(pRun(S2;env;n2m;l2m))
((run-event-loc(e') = y ∈ Id)
∧ (e run-lt(pRun(S2;env;n2m;l2m)) e')
∧ (∃n:ℕ
∃nm:Id
((snd(run-info(pRun(S2;env;n2m;l2m);e')))
= command-to-msg(c;n2m n;l2m nm)
∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e')
= (inl e)
∈ (runEvents(pRun(S2;env;n2m;l2m))?)))))
14. E ⊆r runEvents(pRun(S2;env;n2m;l2m))
15. runEvents(pRun(S2;env;n2m;l2m)) ⊆r E
16. ∀e:runEvents(pRun(S2;env;n2m;l2m)). (loc(e) = run-event-loc(e) ∈ Id)
17. e : E@i
18. loc(e) = (fst(<x, Q>)) ∈ Id
19. ∀P:Process(P.M[P])
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd(P(info(e))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':E
((loc(e') = y ∈ Id)
∧ (e < e')
∧ (∃n:ℕ. ∃nm:Id. (info(e') = command-to-msg(c;n2m n;l2m nm) ∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e') = (inl e) ∈ (E?)))))
20. ↑first(e)
⊢ (iterate-Process(Q;[]) ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
2
1. [M] : Type ⟶ Type
2. Continuous+(P.M[P])
3. n2m : ℕ ⟶ pMsg(P.M[P])@i
4. x : Id@i
5. Q : Process(P.M[P])@i
6. l2m : Id ⟶ pMsg(P.M[P])@i
7. S2 : InitialSystem(P.M[P])@i
8. sub-system(P.M[P];<[<x, Q>], lg-nil()>;S2)
9. env : pEnvType(P.M[P])@i
10. ∀e1,e2:runEvents(pRun(S2;env;n2m;l2m)).
(∀P:Process(P.M[P])
((P ∈ run-prior-state(S2;pRun(S2;env;n2m;l2m);e1))
⇒ (iterate-Process(P;map(λe.run-event-msg(pRun(S2;env;n2m;l2m);e);
run-event-interval(pRun(S2;env;n2m;l2m);e1;e2)))
∈ run-event-state(pRun(S2;env;n2m;l2m);e2)))) supposing
((run-event-step(e1) ≤ run-event-step(e2)) and
(run-event-loc(e1) = run-event-loc(e2) ∈ Id))
11. pRun(S2;env;n2m;l2m) ∈ pRunType(P.M[P])
12. reliable-env(env; pRun(S2;env;n2m;l2m))@i
13. ∀e:runEvents(pRun(S2;env;n2m;l2m)). ∀P:Process(P.M[P]).
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd((P (snd(run-info(pRun(S2;env;n2m;l2m);e))))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':runEvents(pRun(S2;env;n2m;l2m))
((run-event-loc(e') = y ∈ Id)
∧ (e run-lt(pRun(S2;env;n2m;l2m)) e')
∧ (∃n:ℕ
∃nm:Id
((snd(run-info(pRun(S2;env;n2m;l2m);e')))
= command-to-msg(c;n2m n;l2m nm)
∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e')
= (inl e)
∈ (runEvents(pRun(S2;env;n2m;l2m))?)))))
14. E ⊆r runEvents(pRun(S2;env;n2m;l2m))
15. runEvents(pRun(S2;env;n2m;l2m)) ⊆r E
16. ∀e:runEvents(pRun(S2;env;n2m;l2m)). (loc(e) = run-event-loc(e) ∈ Id)
17. e : E@i
18. ¬↑first(e)
19. loc(e) = (fst(<x, Q>)) ∈ Id
20. ∀P:Process(P.M[P])
((P ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
⇒ ∀p∈snd(P(info(e))).let y,c = p
in (com-kind(c) ∈ ``msg choose new``)
⇒ (∃e':E
((loc(e') = y ∈ Id)
∧ (e < e')
∧ (∃n:ℕ. ∃nm:Id. (info(e') = command-to-msg(c;n2m n;l2m nm) ∈ pMsg(P.M[P])))
∧ ((run-cause(pRun(S2;env;n2m;l2m)) e') = (inl e) ∈ (E?)))))
⊢ (iterate-Process(Q;map(λe.info(e);before(pred(e)) @ [pred(e)])) ∈ run-event-state-when(pRun(S2;env;n2m;l2m);e))
Latex:
Latex:
1. [M] : Type {}\mrightarrow{} Type
2. Continuous+(P.M[P])
3. n2m : \mBbbN{} {}\mrightarrow{} pMsg(P.M[P])@i
4. x : Id@i
5. Q : Process(P.M[P])@i
6. l2m : Id {}\mrightarrow{} pMsg(P.M[P])@i
7. S2 : InitialSystem(P.M[P])@i
8. sub-system(P.M[P];<[<x, Q>], lg-nil()>S2)
9. env : pEnvType(P.M[P])@i
10. \mforall{}e1,e2:runEvents(pRun(S2;env;n2m;l2m)).
(\mforall{}P:Process(P.M[P])
((P \mmember{} run-prior-state(S2;pRun(S2;env;n2m;l2m);e1))
{}\mRightarrow{} (iterate-Process(P;map(\mlambda{}e.run-event-msg(pRun(S2;env;n2m;l2m);e);
run-event-interval(pRun(S2;env;n2m;l2m);e1;e2)))
\mmember{} run-event-state(pRun(S2;env;n2m;l2m);e2)))) supposing
((run-event-step(e1) \mleq{} run-event-step(e2)) and
(run-event-loc(e1) = run-event-loc(e2)))
11. pRun(S2;env;n2m;l2m) \mmember{} pRunType(P.M[P])
12. reliable-env(env; pRun(S2;env;n2m;l2m))@i
13. \mforall{}e:runEvents(pRun(S2;env;n2m;l2m)). \mforall{}P:Process(P.M[P]).
((P \mmember{} run-event-state-when(pRun(S2;env;n2m;l2m);e))
{}\mRightarrow{} \mforall{}p\mmember{}snd((P (snd(run-info(pRun(S2;env;n2m;l2m);e))))).
let y,c = p
in (com-kind(c) \mmember{} ``msg choose new``)
{}\mRightarrow{} (\mexists{}e':runEvents(pRun(S2;env;n2m;l2m))
((run-event-loc(e') = y)
\mwedge{} (e run-lt(pRun(S2;env;n2m;l2m)) e')
\mwedge{} (\mexists{}n:\mBbbN{}
\mexists{}nm:Id
((snd(run-info(pRun(S2;env;n2m;l2m);e'))) = command-to-msg(c;n2m n;l2m nm)))
\mwedge{} ((run-cause(pRun(S2;env;n2m;l2m)) e') = (inl e)))))
14. E \msubseteq{}r runEvents(pRun(S2;env;n2m;l2m))
15. runEvents(pRun(S2;env;n2m;l2m)) \msubseteq{}r E
16. \mforall{}e:runEvents(pRun(S2;env;n2m;l2m)). (loc(e) = run-event-loc(e))
17. run-cause(pRun(S2;env;n2m;l2m)) \mmember{} E {}\mrightarrow{} (E?)
18. e : E@i
19. loc(e) = (fst(<x, Q>))
20. \mforall{}P:Process(P.M[P])
((P \mmember{} run-event-state-when(pRun(S2;env;n2m;l2m);e))
{}\mRightarrow{} \mforall{}p\mmember{}snd(P(info(e))).let y,c = p
in (com-kind(c) \mmember{} ``msg choose new``)
{}\mRightarrow{} (\mexists{}e':E
((loc(e') = y)
\mwedge{} (e < e')
\mwedge{} (\mexists{}n:\mBbbN{}. \mexists{}nm:Id. (info(e') = command-to-msg(c;n2m n;l2m nm)))
\mwedge{} ((run-cause(pRun(S2;env;n2m;l2m)) e') = (inl e)))))
\mvdash{} (iterate-Process(Q;map(\mlambda{}e.info(e);before(e))) \mmember{} run-event-state-when(pRun(S2;env;n2m;l2m);e))
By
Latex:
(Thin (-4) THEN RecUnfold `es-before` 0 THEN AutoSplit)
Home
Index