{ 
[Info:Type]
es:EO+(Info). X:EClass(Top). fs:sys-antecedent(es;X) List. s:FSet{E(X)}.
c:FSet{E(X)}. (c = fs closure of s) }
{ Proof }
Definitions occuring in Statement :
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-eq: es-eq(es),
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
exists: x:A. B[x],
list: type List,
universe: Type,
fset: FSet{s},
fset-closure: (c = fs closure of s)
Definitions :
member: t 
T,
implies: P 
Q,
all: x:A. B[x],
prop: 
,
true: True,
squash: 
T,
es-E-interface: E(X),
and: P 
Q,
ifthenelse: if b then t else f fi ,
btrue: tt,
assert: 
b,
ycomb: Y,
select: l[i],
length: ||as||,
cand: A c B,
nat: 
,
exists: x:A. B[x],
false: False,
l_member: (x l),
uall: [x:A]. B[x],
sys-antecedent: sys-antecedent(es;Sys),
or: P 
Q,
es-causle: e c
e',
guard: {T},
uimplies: b supposing a,
sq_type: SQType(T),
not: 
A,
subtype: S 
T
Lemmas :
in-eclass_wf,
assert_wf,
es-E_wf,
es-causle_wf,
es-E-interface_wf,
event-ordering+_inc,
assert_elim,
bool_subtype_base,
bool_wf,
subtype_base_sq
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}fs:sys-antecedent(es;X) List. \mforall{}s:FSet\{E(X)\}.
\mexists{}c:FSet\{E(X)\}. (c = fs closure of s)
Date html generated:
2011_08_16-PM-04_00_38
Last ObjectModification:
2011_06_20-AM-00_35_35
Home
Index