Nuprl Lemma : run-event-in-transit_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[e:runEvents(r)].
  (run-event-in-transit(r;e) ∈ LabeledGraph(pInTransit(P.M[P])))
Proof
Definitions occuring in Statement : 
run-event-in-transit: run-event-in-transit(r;e)
, 
runEvents: runEvents(r)
, 
pRunType: pRunType(T.M[T])
, 
pInTransit: pInTransit(P.M[P])
, 
labeled-graph: LabeledGraph(T)
, 
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
, 
runEvents: runEvents(r)
, 
run-event-in-transit: run-event-in-transit(r;e)
, 
is-run-event: is-run-event(r;t;x)
, 
pi1: fst(t)
, 
pi2: snd(t)
, 
pRunType: pRunType(T.M[T])
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
spreadn: spread3, 
ldag: LabeledDAG(T)
, 
prop: ℙ
, 
bool: 𝔹
, 
unit: Unit
, 
it: ⋅
, 
btrue: tt
, 
band: p ∧b q
, 
ifthenelse: if b then t else f fi 
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
uimplies: b supposing a
, 
outl: outl(x)
, 
isl: isl(x)
, 
assert: ↑b
, 
bfalse: ff
, 
false: False
Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[e:runEvents(r)].
    (run-event-in-transit(r;e)  \mmember{}  LabeledGraph(pInTransit(P.M[P])))
Date html generated:
2016_05_17-AM-10_42_43
Last ObjectModification:
2015_12_29-PM-05_23_47
Theory : process-model
Home
Index