{ 
[M:Type 
Type]. [r:pRunType(P.M[P])].
(total-run-lt-witness() 
e1,e2:runEvents(r).
(e1 = e2)
(e1 run-lt(r) e2)
(e2 run-lt(r) e1)
supposing run-event-loc(e1)
= run-event-loc(e2)) }
{ Proof }
Definitions occuring in Statement :
total-run-lt-witness: total-run-lt-witness(),
run-lt: run-lt(r),
run-event-loc: run-event-loc(e),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
Id: Id,
uimplies: b supposing a,
uall: [x:A]. B[x],
infix_ap: x f y,
so_apply: x[s],
all: x:A. B[x],
or: P Q,
member: t T,
function: x:A B[x],
universe: Type,
equal: s = t
Definitions :
less: if (a) < (b) then c else d,
spread: spread def,
rel_exp_one,
decidable__le,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
sq_type: SQType(T),
subtype_rel: A 
r B,
sqequal: s ~ t,
limited-type: LimitedType,
implies: P 
Q,
so_apply: x[s],
lambda: 
x.A[x],
axiom: Ax,
total-run-lt-witness: total-run-lt-witness(),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
union: left + right,
prop: 
,
universe: Type,
pRunType: pRunType(T.M[T]),
so_lambda: 
x.t[x],
function: x:A B[x],
Auto: Error :Auto,
CollapseTHEN: Error :CollapseTHEN,
Try: Error :Try,
total-run-lt,
apply: f a,
run-lt: run-lt(r),
infix_ap: x f y,
or: P Q,
runEvents: runEvents(r),
equal: s = t,
run-event-loc: run-event-loc(e),
Id: Id,
uimplies: b supposing a,
all: x:A. B[x],
member: t T,
AssertBY: Error :AssertBY,
D: Error :D,
CollapseTHENA: Error :CollapseTHENA,
RepeatFor: Error :RepeatFor
Lemmas :
member_wf,
total-run-lt,
uall_wf,
pRunType_wf,
run-event-loc_wf,
run-lt_wf,
Id_wf,
runEvents_wf,
subtype_base_sq
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])].
(total-run-lt-witness() \mmember{} \mforall{}e1,e2:runEvents(r).
(e1 = e2) \mvee{} (e1 run-lt(r) e2) \mvee{} (e2 run-lt(r) e1)
supposing run-event-loc(e1) = run-event-loc(e2))
Date html generated:
2011_08_17-PM-03_38_34
Last ObjectModification:
2011_06_18-AM-11_19_46
Home
Index