{ 
[M:Type 
Type]. [S0:System(P.M[P])]. [r:fulpRunType(P.M[P])].
[e:
Id].
(run-prior-state(S0;r;e) 
Process(P.M[P]) List) }
{ Proof }
Definitions occuring in Statement :
run-prior-state: run-prior-state(S0;r;e),
fulpRunType: fulpRunType(T.M[T]),
System: System(P.M[P]),
Process: Process(P.M[P]),
Id: Id,
nat: ,
uall: [x:A]. B[x],
so_apply: x[s],
member: t T,
function: x:A B[x],
product: x:A B[x],
list: type List,
universe: Type
Definitions :
suptype: suptype(S; T),
tl: tl(l),
hd: hd(l),
sq_type: SQType(T),
cons: [car / cdr],
in-eclass: e 
X,
eq_knd: a = b,
l_member: (x l),
filter: filter(P;l),
is-dag: is-dag(g),
corec: corec(T.F[T]),
process: process(P.M[P];P.E[P]),
component: component(P.M[P]),
nil: [],
pi1: fst(t),
eq_id: a = b,
pi2: snd(t),
spreadn: spread3,
spread: spread def,
last: last(L),
inl: inl x ,
it: 
,
inr: inr x ,
null: null(as),
ifthenelse: if b then t else f fi ,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
bool: 
,
assert: 
b,
real: 
,
grp_car: |g|,
prop: 
,
natural_number: $n,
from-upto: [n, m),
is-run-event: is-run-event(r;t;x),
mapfilter: mapfilter(f;P;L),
run-event-state: run-event-state(r;e),
let: let,
run-event-step: run-event-step(e),
run-event-loc: run-event-loc(e),
run-event-history: run-event-history(r;e),
run-event-local-pred: run-event-local-pred(r;e),
void: Void,
fpf-dom: x dom(f),
false: False,
guard: {T},
pair: <a, b>,
pInTransit: pInTransit(P.M[P]),
unit: Unit,
pMsg: pMsg(P.M[P]),
int: 
,
subtype: S 
T,
tag-by: zT,
rev_implies: P 
Q,
or: P 
Q,
implies: P 
Q,
iff: P Q,
labeled-graph: LabeledGraph(T),
record+: record+,
record: record(x.T[x]),
fset: FSet{T},
isect2: T1 
T2,
b-union: A 
B,
bag: bag(T),
top: Top,
true: True,
fpf-sub: f g,
deq: EqDecider(T),
ma-state: State(ds),
class-program: ClassProgram(T),
es-E-interface: E(X),
union: left + right,
fpf-cap: f(x)?z,
lambda: 
x.A[x],
eclass: EClass(A[eo; e]),
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
atom: Atom$n,
set: {x:A| B[x]} ,
ldag: LabeledDAG(T),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
and: P 
Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
all: x:A. B[x],
function: x:A B[x],
universe: Type,
System: System(P.M[P]),
so_lambda: 
x.t[x],
fulpRunType: fulpRunType(T.M[T]),
uall: [x:A]. B[x],
isect: x:A. B[x],
apply: f a,
run-prior-state: run-prior-state(S0;r;e),
axiom: Ax,
equal: s = t,
Process: Process(P.M[P]),
MaAuto: Error :MaAuto,
Complete: Error :Complete,
CollapseTHEN: Error :CollapseTHEN,
Try: Error :Try,
Auto: Error :Auto,
Id: Id,
nat: ,
product: x:A B[x],
list: type List,
RepUR: Error :RepUR,
D: Error :D,
so_apply: x[s],
pRunType: pRunType(T.M[T]),
member: t T,
AssertBY: Error :AssertBY,
tactic: Error :tactic,
CollapseTHENA: Error :CollapseTHENA
Lemmas :
Id_wf,
pMsg_wf,
top_wf,
ldag_wf,
pInTransit_wf,
fulpRunType_wf,
pRunType_wf,
subtype_rel_wf,
member_wf,
System_wf,
nat_wf,
Process_wf,
unit_wf,
subtype_rel_function,
subtype_rel_self,
subtype_rel_simple_product,
from-upto_wf,
le_wf,
mapfilter_wf,
is-run-event_wf,
assert_wf,
bool_wf,
component_wf,
eq_id_wf,
pi1_wf_top,
last_wf,
not_wf,
false_wf,
pos_length2
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[S0:System(P.M[P])]. \mforall{}[r:fulpRunType(P.M[P])]. \mforall{}[e:\mBbbN{} \mtimes{} Id].
(run-prior-state(S0;r;e) \mmember{} Process(P.M[P]) List)
Date html generated:
2011_08_16-PM-07_00_06
Last ObjectModification:
2011_06_18-AM-11_14_51
Home
Index