{ 
[es:EO]. [e,e':E].
(TERMOF{decidable__es-le:o, 1:l, i:l} es e' e ~ TERMOF{decidable__es-le:o,
1:l,
1:l}
es
e'
e) }
{ Proof }
Definitions occuring in Statement :
es-E: E,
event_ordering: EO,
uall: [x:A]. B[x],
apply: f a,
sqequal: s ~ t
Definitions :
iff_preserves_decidability,
deq: EqDecider(T),
assert: 
b,
deq_property,
iff: P 
Q,
decidable_functionality,
decidable__equal-es-E,
cand: A c
B,
decidable__cand,
decidable__es-causl,
exists: 
x:A. B[x],
union: left + right,
decidable__or,
decidable__es-E-equal,
decidable__es-locl,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
less_than: a < b,
product: x:A 
B[x],
uiff: uiff(P;Q),
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record-select: r.x,
dep-isect: Error :dep-isect,
record+: record+,
implies: P Q,
infix_ap: x f y,
Id: Id,
es-causl: (e < e'),
so_lambda: 
x.t[x],
and: P Q,
es-locl: (e <loc e'),
equal: s = t,
prop: 
,
universe: Type,
not: 
A,
or: P 
Q,
sq_type: SQType(T),
uimplies: b supposing a,
es-le: e loc e' ,
decidable: Dec(P),
decidable__es-le,
apply: f a,
subtype_rel: A 
r B,
function: x:A 
B[x],
all: x:A. B[x],
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t 
T,
es-E: E,
event_ordering: EO,
sqequal: s ~ t,
Repeat: Error :Repeat,
CollapseTHEN: Error :CollapseTHEN,
RepeatFor: Error :RepeatFor,
Auto: Error :Auto,
tactic: Error :tactic
Lemmas :
uall_wf,
uiff_wf,
assert_wf,
isect_subtype_base,
iff_wf,
decidable_wf,
subtype_base_sq,
event_ordering_wf,
es-E_wf,
es-causl_wf,
es-locl_wf,
es-le_wf,
Id_wf,
product_subtype_base,
union_subtype_base,
not_wf,
deq_wf
\mforall{}[es:EO]. \mforall{}[e,e':E].
(TERMOF\{decidable\_\_es-le:o, 1:l, i:l\} es e' e \msim{} TERMOF\{decidable\_\_es-le:o, 1:l, 1:l\} es e' e)
Date html generated:
2011_08_16-AM-10_34_08
Last ObjectModification:
2011_06_18-AM-09_15_07
Home
Index