{ 
[the_es:EO]. [e:E]. (
(e < e)) }
{ Proof }
Definitions occuring in Statement :
es-causl: (e < e'),
es-E: E,
event_ordering: EO,
uall: [x:A]. B[x],
not: A
Definitions :
universe: Type,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
assert: 
b,
less_than: a < b,
uimplies: b supposing a,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
infix_ap: x f y,
apply: f a,
record-select: r.x,
dep-isect: Error :dep-isect,
record+: record+,
subtype_rel: A 
r B,
prop: 
,
all: x:A. B[x],
uall: [x:A]. B[x],
isect: 
x:A. B[x],
equal: s = t,
implies: P 
Q,
lambda: 
x.A[x],
es-causl: (e < e'),
function: x:A 
B[x],
false: False,
void: Void,
member: t 
T,
es-E: E,
event_ordering: EO,
not: A,
Repeat: Error :Repeat,
MaAuto: Error :MaAuto,
Complete: Error :Complete,
Try: Error :Try,
CollapseTHEN: Error :CollapseTHEN,
tactic: Error :tactic,
subtract: n - m,
less: if (a) < (b) then c else d,
lt_int: i <z j,
bnot: 
b,
le_int: i z j,
select: l[i],
add: n + m,
list_ind: list_ind def,
ycomb: Y,
length: ||as||,
l_member: (x l),
list: type List,
int: 
,
set: {x:A| B[x]} ,
nat: 
,
Id: Id,
record: record(x.T[x]),
top: Top,
atom_eq: if a=b then c else d,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
atom: Atom,
token: "$token",
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
guard: {T},
so_lambda: 
x.t[x],
CollapseTHENA: Error :CollapseTHENA
Lemmas :
es-causl-wellfnd,
event_ordering_wf,
es-E_wf,
not_wf,
false_wf,
es-causl_wf
\mforall{}[the$_{es}$:EO]. \mforall{}[e:E]. (\mneg{}(e < e))
Date html generated:
2011_08_16-AM-10_31_28
Last ObjectModification:
2011_06_18-AM-09_13_14
Home
Index