{ 
[M:Type 
Type]
r:pRunType(P.M[P]). e1,e2:runEvents(r). Dec(e1 run-pred(r) e2) }
{ Proof }
Definitions occuring in Statement :
run-pred: run-pred(r),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
decidable: Dec(P),
uall: [x:A]. B[x],
infix_ap: x f y,
so_apply: x[s],
all: x:A. B[x],
function: x:A B[x],
universe: Type
Definitions :
void: Void,
top: Top,
pMsg: pMsg(P.M[P]),
implies: P 
Q,
or: P 
Q,
eclass: EClass(A[eo; e]),
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
decide: case b of inl(x) => s[x] | inr(y) => t[y],
assert: 
b,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
and: P 
Q,
uiff: uiff(P;Q),
subtype_rel: A 
r B,
bool: 
,
decision: Decision,
union: left + right,
set: {x:A| B[x]} ,
real: 
,
grp_car: |g|,
subtype: S T,
nat: 
,
so_apply: x[s],
prop: 
,
run-pred: run-pred(r),
apply: f a,
infix_ap: x f y,
decidable: Dec(P),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
universe: Type,
pRunType: pRunType(T.M[T]),
function: x:A B[x],
member: t 
T,
so_lambda: 
x.t[x],
all: x:A. B[x],
runEvents: runEvents(r),
RepUR: Error :RepUR,
CollapseTHEN: Error :CollapseTHEN,
RepeatFor: Error :RepeatFor,
D: Error :D,
Auto: Error :Auto,
run-info: run-info(r;e),
pi1: fst(t),
Id: Id,
int: 
,
product: x:A 
B[x],
equal: s = t,
CollapseTHENA: Error :CollapseTHENA,
Complete: Error :Complete,
Try: Error :Try,
Unfold: Error :Unfold,
axiom: Ax,
lambda: x.A[x],
inr: inr x ,
inl: inl x ,
eq_int: (i =
j),
pi2: snd(t),
eq_id: a = b,
band: p 
q,
let: let,
ifthenelse: if b then t else f fi ,
pair: <a, b>,
run-event-step: run-event-step(e),
lt_int: i <z j,
run-event-loc: run-event-loc(e),
tactic: Error :tactic,
cand: A c B,
IdLnk: IdLnk,
eq_atom: x =a y,
null: null(as),
set_blt: a < b,
grp_blt: a < b,
dcdr-to-bool: [d],
bl-all: (xL.P[x])_b,
bl-exists: (
xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
eq_atom: eq_atom$n(x;y),
qeq: qeq(r;s),
q_less: q_less(r;s),
q_le: q_le(r;s),
deq-member: deq-member(eq;x;L),
deq-disjoint: deq-disjoint(eq;as;bs),
deq-all-disjoint: deq-all-disjoint(eq;ass;bs),
eq_str: Error :eq_str,
es-E-interface: E(X),
atom_eq: atomeqn def,
sq_type: SQType(T),
sqequal: s ~ t,
append: as @ bs,
guard: {T},
locl: locl(a),
Knd: Knd,
list: type List,
l_member: (x l),
it: 
,
le_int: i z j,
limited-type: LimitedType,
bfalse: ff,
btrue: tt,
iff: P 
Q,
eq_lnk: a = b,
es-eq-E: e = e',
bimplies: p q,
bor: p q,
bnot: b,
unit: Unit,
false: False,
atom: Atom$n
Lemmas :
assert_wf,
iff_weakening_uiff,
not_wf,
subtype_base_sq,
assert-eq-id,
uiff_inversion,
bnot_wf,
not_functionality_wrt_uiff,
assert_of_bnot,
uiff_transitivity,
eqff_to_assert,
eqtt_to_assert,
false_wf,
nat_properties,
it_wf,
unit_wf,
subtype_rel_wf,
assert_of_lt_int,
le_wf,
assert_functionality_wrt_uiff,
bnot_of_lt_int,
assert_of_le_int,
le_int_wf,
eq_int_wf,
bfalse_wf,
assert_of_eq_int,
pi2_wf,
ifthenelse_wf,
decidable_wf,
run-pred_wf,
runEvents_wf,
pRunType_wf,
member_wf,
band_wf,
bool_wf,
nat_wf,
run-event-step_wf,
lt_int_wf,
run-event-loc_wf,
eq_id_wf,
Id_wf,
pi1_wf_top,
run-info_wf,
pMsg_wf,
top_wf
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}r:pRunType(P.M[P]). \mforall{}e1,e2:runEvents(r). Dec(e1 run-pred(r) e2)
Date html generated:
2011_08_16-PM-07_04_49
Last ObjectModification:
2010_11_29-PM-07_02_23
Home
Index