{ 
[Info:Type]. [es:EO+(Info)]. [Sys:EClass(Top)].
(sys-antecedent(es;Sys) 
Type) }
{ Proof }
Definitions occuring in Statement :
sys-antecedent: sys-antecedent(es;Sys),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uall: [x:A]. B[x],
top: Top,
member: t T,
universe: Type
Definitions :
bool: 
,
in-eclass: e 
X,
fpf-cap: f(x)?z,
es-causl: (e < e'),
intensional-universe: IType,
record: record(x.T[x]),
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
ifthenelse: if b then t else f fi ,
union: left + right,
so_lambda: 
x.t[x],
top: Top,
lambda: x.A[x],
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
assert: 
b,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
dep-isect: Error :dep-isect,
record+: record+,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
record-select: r.x,
subtype_rel: A 
r B,
es-E: E,
subtype: S T,
event_ordering: EO,
prop: 
,
sys-antecedent: sys-antecedent(es;Sys),
event-ordering+: EO+(Info),
uall: [x:A]. B[x],
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
isect: 
x:A. B[x],
member: t T,
axiom: Ax,
equal: s = t,
universe: Type,
apply: f a,
set: {x:A| B[x]} ,
all: x:A. B[x],
function: x:A 
B[x],
es-E-interface: E(X),
es-causle: e c e',
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
subtype_rel_wf,
es-E-interface_wf,
es-E_wf,
member_wf,
es-causle_wf,
eclass_wf,
event-ordering+_wf,
event-ordering+_inc,
top_wf,
uall_wf,
es-base-E_wf,
subtype_rel_self,
assert_wf,
intensional-universe_wf,
es-causl_wf,
in-eclass_wf
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[Sys:EClass(Top)]. (sys-antecedent(es;Sys) \mmember{} Type)
Date html generated:
2011_08_16-AM-11_44_28
Last ObjectModification:
2011_06_20-AM-00_34_47
Home
Index