{ 
[M:Type 
Type]
r:pRunType(P.M[P])
rel_finite(runEvents(r);run-pred(r))
supposing e:runEvents(r)
((fst(fst(run-info(r;e)))) < run-event-step(e)) }
{ Proof }
Definitions occuring in Statement :
run-pred: run-pred(r),
run-event-step: run-event-step(e),
runEvents: runEvents(r),
run-info: run-info(r;e),
pRunType: pRunType(T.M[T]),
uimplies: b supposing a,
uall: [x:A]. B[x],
so_apply: x[s],
pi1: fst(t),
all: x:A. B[x],
less_than: a < b,
function: x:A B[x],
universe: Type,
rel_finite: rel_finite(T;R)
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
so_apply: x[s],
uimplies: b supposing a,
rel_finite: rel_finite(T;R),
member: t 
T,
so_lambda: 
x.t[x],
exists: 
x:A. B[x],
implies: P 
Q,
infix_ap: x f y,
prop: 
,
top: Top,
subtype: S 
T,
nat: 
,
iff: P 
Q,
and: P 
Q,
rev_implies: P Q
Lemmas :
runEvents_wf,
prior-run-events_wf,
run-event-step_wf,
member-prior-run-events,
run-pred-step-less,
run-pred_wf,
l_member_wf,
pi1_wf_top,
top_wf,
run-info_wf,
Id_wf,
pMsg_wf,
nat_wf,
pRunType_wf
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}r:pRunType(P.M[P])
rel\_finite(runEvents(r);run-pred(r))
supposing \mforall{}e:runEvents(r). ((fst(fst(run-info(r;e)))) < run-event-step(e))
Date html generated:
2011_08_16-PM-07_03_15
Last ObjectModification:
2011_06_18-AM-11_17_02
Home
Index