Nuprl Lemma : run-initialization_wf

[M:Type ─→ Type]. ∀[r:pRunType(P.M[P])]. ∀[G:LabeledGraph(pInTransit(P.M[P]))].  (run-initialization(r;G) ∈ ℙ)


Proof




Definitions occuring in Statement :  run-initialization: run-initialization(r;G) pRunType: pRunType(T.M[T]) pInTransit: pInTransit(P.M[P]) labeled-graph: LabeledGraph(T) uall: [x:A]. B[x] prop: so_apply: x[s] member: t ∈ T function: x:A ─→ B[x] universe: Type
Lemmas :  lg-all_wf all_wf runEvents_wf less_than_wf labeled-graph_wf pInTransit_wf pRunType_wf

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[G:LabeledGraph(pInTransit(P.M[P]))].
    (run-initialization(r;G)  \mmember{}  \mBbbP{})



Date html generated: 2015_07_23-AM-11_15_52
Last ObjectModification: 2015_01_29-AM-00_05_11

Home Index