{ 
[Info,A:Type]. [I:EClass(A)]. [P:es:EO+(Info) 
E 
].
[p:es:EO+(Info). e:E. Dec(P[es;e])].
((I|
p) 
EClass(A)) }
{ Proof }
Definitions occuring in Statement :
es-interface-co-restrict: (I|p),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
decidable: Dec(P),
uall: [x:A]. B[x],
prop: ,
so_apply: x[s1;s2],
all: x:A. B[x],
member: t T,
function: x:A B[x],
universe: Type
Definitions :
inr: inr x ,
pair: <a, b>,
bool: 
,
inl: inl x ,
limited-type: LimitedType,
atom: Atom,
top: Top,
es-base-E: es-base-E(es),
token: "$token",
so_apply: x[s],
guard: {T},
l_member: (x l),
es-E-interface: E(X),
so_lambda: 
x.t[x],
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
set: {x:A| B[x]} ,
ifthenelse: if b then t else f fi ,
assert: 
b,
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
less_than: a < b,
uimplies: b supposing a,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
or: P 
Q,
subtype_rel: A 
r B,
void: Void,
implies: P 
Q,
false: False,
not: A,
subtype: S T,
union: left + right,
axiom: Ax,
empty-bag: {},
decide: case b of inl(x) => s[x] | inr(y) => t[y],
lambda: x.A[x],
apply: f a,
so_apply: x[s1;s2],
decidable: Dec(P),
all: x:A. B[x],
eclass: EClass(A[eo; e]),
es-interface-co-restrict: (I|p),
equal: s = t,
bag: bag(T),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
function: x:A B[x],
prop: ,
universe: Type,
es-E: E,
event_ordering: EO,
event-ordering+: EO+(Info),
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
event-ordering+_wf,
es-E_wf,
bag_wf,
subtype_rel_wf,
decidable_wf,
not_wf,
member_wf,
event-ordering+_inc,
empty-bag_wf,
uall_wf,
es-base-E_wf,
subtype_rel_self
\mforall{}[Info,A:Type]. \mforall{}[I:EClass(A)]. \mforall{}[P:es:EO+(Info) {}\mrightarrow{} E {}\mrightarrow{} \mBbbP{}].
\mforall{}[p:\mforall{}es:EO+(Info). \mforall{}e:E. Dec(P[es;e])].
((I|\mneg{}p) \mmember{} EClass(A))
Date html generated:
2011_08_16-PM-04_25_48
Last ObjectModification:
2011_06_20-AM-00_50_16
Home
Index