Nuprl Lemma : run-event-msg_wf

[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[e:runEvents(r)].  (run-event-msg(r;e) ∈ pMsg(P.M[P]))


Proof




Definitions occuring in Statement :  run-event-msg: run-event-msg(r;e) runEvents: runEvents(r) pRunType: pRunType(T.M[T]) pMsg: pMsg(P.M[P]) uall: [x:A]. B[x] so_apply: x[s] member: t ∈ T function: x:A ⟶ B[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T run-event-msg: run-event-msg(r;e) so_lambda: λ2x.t[x] so_apply: x[s]

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[e:runEvents(r)].    (run-event-msg(r;e)  \mmember{}  pMsg(P.M[P]))



Date html generated: 2016_05_17-AM-10_42_17
Last ObjectModification: 2015_12_29-PM-05_23_57

Theory : process-model


Home Index