{ 
m:
. Dec(i:
m. 
j:i. True) }
{ Proof }
Definitions occuring in Statement :
int_seg: {i..j
},
decidable: Dec(P),
all: x:A. B[x],
exists: x:A. B[x],
true: True,
natural_number: $n,
int:
Definitions :
proper-iseg: L1 < L2,
iseg: l1 
l2,
multiply: n * m,
gt: i > j,
length: ||as||,
void: Void,
real: 
,
rationals: 
,
subtype: S 
T,
lelt: i j < k,
lambda: 
x.A[x],
member: t 
T,
strong-subtype: strong-subtype(A;B),
ge: i 
j ,
uiff: uiff(P;Q),
subtype_rel: A r B,
union: left + right,
or: P 
Q,
false: False,
not: 
A,
iff: P 
Q,
less_than: a < b,
le: A B,
assert: 
b,
natural_number: $n,
list: type List,
nat: ,
and: P 
Q,
unit: Unit,
so_lambda: 
x.t[x],
divides: b | a,
assoced: a ~ b,
set_leq: a b,
set_lt: a <p b,
grp_lt: a < b,
cand: A c B,
l_member: (x l),
l_contains: A B,
inject: Inj(A;B;f),
reducible: reducible(a),
prime: prime(a),
squash: 
T,
l_exists: (xL. P[x]),
l_all: (xL.P[x]),
fun-connected: y is f*(x),
qle: r s,
qless: r < s,
q-rel: q-rel(r;x),
i-finite: i-finite(I),
i-closed: i-closed(I),
p-outcome: Outcome,
fset-member: a s,
f-subset: xs ys,
fset-closed: (s closed under fs),
set: {x:A| B[x]} ,
l_disjoint: l_disjoint(T;l1;l2),
cs-not-completed: in state s, a has not completed inning i,
cs-archived: by state s, a archived v in inning i,
cs-passed: by state s, a passed inning i without archiving a value,
cs-inning-committed: in state s, inning i has committed v,
cs-inning-committable: in state s, inning i could commit v ,
cs-archive-blocked: in state s, ws' blocks ws from archiving v in inning i,
cs-precondition: state s may consider v in inning i,
es-causl: (e < e'),
es-locl: (e <loc e'),
es-le: e loc e' ,
es-causle: e c e',
es-E: E,
existse-before: e<e'.P[e],
existse-le: ee'.P[e],
alle-lt: e<e'.P[e],
alle-le: ee'.P[e],
alle-between1: e[e1,e2).P[e],
existse-between1: e[e1,e2).P[e],
alle-between2: e[e1,e2].P[e],
existse-between2: e[e1,e2].P[e],
existse-between3: e(e1,e2].P[e],
es-fset-loc: i locs(s),
es-r-immediate-pred: es-r-immediate-pred(es;R;e';e),
same-thread: same-thread(es;p;e;e'),
implies: P Q,
collect-event: collect-event(es;X;n;v.num[v];L.P[L];e),
cut-order: a (X;f) b,
path-goes-thru: x-f*-y thru i,
lg-edge: lg-edge(g;a;b),
equal: s = t,
int: ,
exists: x:A. B[x],
product: x:A 
B[x],
true: True,
int_seg: {i..j},
prop: 
,
universe: Type,
ses-legal-sequence: Legal(pas) given prvt,
ses-action: Action(e),
uall: [x:A]. B[x],
uimplies: b supposing a,
isect: 
x:A. B[x],
decidable: Dec(P),
all: x:A. B[x],
function: x:A 
B[x],
infix_ap: x f y,
apply: f a
Lemmas :
decidable__lt,
decidable_wf,
int_seg_wf,
true_wf,
not_wf,
decidable__cand,
decidable__all_int_seg,
int_seg_properties,
le_wf,
false_wf,
nat_wf,
member_wf
\mforall{}m:\mBbbZ{}. Dec(\mforall{}i:\mBbbN{}m. \mexists{}j:\mBbbN{}i. True)
Date html generated:
2011_08_17-PM-07_39_23
Last ObjectModification:
2010_12_23-AM-00_45_15
Home
Index