{ [M:Type  Type]. [r:pRunType(P.M[P])].
    (deq-runEvents-witness()  e1,e2:runEvents(r).  Dec(e1 = e2)) }

{ Proof }



Definitions occuring in Statement :  deq-runEvents-witness: deq-runEvents-witness() runEvents: runEvents(r) pRunType: pRunType(T.M[T]) decidable: Dec(P) uall: [x:A]. B[x] so_apply: x[s] all: x:A. B[x] member: t  T function: x:A  B[x] universe: Type equal: s = t
Definitions :  decidable__equal_Id 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) uimplies: b supposing a subtype_rel: A r B sqequal: s ~ t limited-type: LimitedType implies: P  Q so_apply: x[s] lambda: x.A[x] axiom: Ax deq-runEvents-witness: deq-runEvents-witness() prop: pRunType: pRunType(T.M[T]) universe: Type isect: x:A. B[x] uall: [x:A]. B[x] function: x:A  B[x] so_lambda: x.t[x] Auto: Error :Auto,  CollapseTHEN: Error :CollapseTHEN,  Try: Error :Try,  decidable__equal_runEvents apply: f a runEvents: runEvents(r) equal: s = t decidable: Dec(P) all: x:A. B[x] member: t  T AssertBY: Error :AssertBY,  D: Error :D,  CollapseTHENA: Error :CollapseTHENA,  RepeatFor: Error :RepeatFor
Lemmas :  member_wf decidable__equal_runEvents uall_wf pRunType_wf decidable_wf runEvents_wf subtype_base_sq

\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].
    (deq-runEvents-witness()  \mmember{}  \mforall{}e1,e2:runEvents(r).    Dec(e1  =  e2))


Date html generated: 2011_08_16-PM-06_58_25
Last ObjectModification: 2011_06_18-AM-11_13_25

Home Index