---

Step * of Lemma run-event-state_wf

∀[M:Type ⟶ Type]. ∀[r:fulpRunType(P.M[P])]. ∀[e:runEvents(r)].  (run-event-state(r;e) ∈ Process(P.M[P]) List)
BY
{ (Assert ∀[M:Type ⟶ Type]. ∀[r:fulpRunType(P.M[P])]. ∀[e:ℕ × Id].  (run-event-state(r;e) ∈ Process(P.M[P]) List) BY
         ProveWfLemma) }

1
1. M : Type ⟶ Type
2. r : fulpRunType(P.M[P])
3. e1 : ℕ
4. e2 : Id
⊢ let info,Cs,G = r e1 in 
  mapfilter(λc.(snd(c));λc.fst(c) = e2;Cs) ∈ Process(P.M[P]) List

2
1. ∀[M:Type ⟶ Type]. ∀[r:fulpRunType(P.M[P])]. ∀[e:ℕ × Id].  (run-event-state(r;e) ∈ Process(P.M[P]) List)
⊢ ∀[M:Type ⟶ Type]. ∀[r:fulpRunType(P.M[P])]. ∀[e:runEvents(r)].  (run-event-state(r;e) ∈ Process(P.M[P]) List)

---

Latex:

---

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:fulpRunType(P.M[P])].  \mforall{}[e:runEvents(r)].
    (run-event-state(r;e)  \mmember{}  Process(P.M[P])  List)


By

---

Latex:
(Assert  \mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:fulpRunType(P.M[P])].  \mforall{}[e:\mBbbN{}  \mtimes{}  Id].
                    (run-event-state(r;e)  \mmember{}  Process(P.M[P])  List)  BY
              ProveWfLemma)

---

Home Index