Nuprl Lemma : prior-run-events_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[t:ℕ].  (prior-run-events(r;t) ∈ runEvents(r) List)
Proof
Definitions occuring in Statement : 
prior-run-events: prior-run-events(r;t)
, 
runEvents: runEvents(r)
, 
pRunType: pRunType(T.M[T])
, 
list: T List
, 
nat: ℕ
, 
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
, 
prior-run-events: prior-run-events(r;t)
, 
nat: ℕ
, 
subtype_rel: A ⊆r B
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
pRunType: pRunType(T.M[T])
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
uimplies: b supposing a
, 
top: Top
, 
prop: ℙ
, 
runEvents: runEvents(r)
, 
isl: isl(x)
, 
pi1: fst(t)
, 
pi2: snd(t)
, 
is-run-event: is-run-event(r;t;x)
, 
outl: outl(x)
, 
band: p ∧b q
, 
ifthenelse: if b then t else f fi 
, 
btrue: tt
, 
assert: ↑b
, 
spreadn: spread3, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
rev_uimplies: rev_uimplies(P;Q)
, 
bfalse: ff
, 
false: False
Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[t:\mBbbN{}].    (prior-run-events(r;t)  \mmember{}  runEvents(r)  List)
Date html generated:
2016_05_17-AM-10_47_35
Last ObjectModification:
2015_12_29-PM-05_22_25
Theory : process-model
Home
Index