{ 
[Info:{Info:Type| 
Info} ]
A:{T:Type| valueall-type(T)}
[X:EClass(A)]
Xpr:NormalLProgrammable(A;X)
(prior-prc(A;Xpr) 
NormalLProgrammable(A;Prior(X))) }
{ Proof }
Definitions occuring in Statement :
prior-prc: prior-prc(A;Xpr),
normal-locally-programmable: NormalLProgrammable(A;X),
primed-class: Prior(X),
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
all: x:A. B[x],
squash: T,
member: t T,
set: {x:A| B[x]} ,
universe: Type,
valueall-type: valueall-type(T)
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
member: t T,
prior-prc: prior-prc(A;Xpr),
delay-program: delay-program,
empty-bag: {},
primed-class-locally-programmable,
primed-class-opt-locally-programmable,
unit: Unit,
bag: bag(T),
evalall: evalall(t),
let: let,
ifthenelse: if b then t else f fi ,
lt_int: i <z j,
bag-size: bag-size(bs),
band: p 
q,
bnot: 
b,
isl: isl(x),
eq_int: (i =
j),
it: 
,
spreadn: spread4,
permutation: permutation(T;L1;L2),
int_seg: {i..j
},
and: P Q,
inject: Inj(A;B;f),
permute_list: (L o f),
exists: 
x:A. B[x],
lelt: i 
j < k,
le: A B,
false: False,
not: A,
implies: P 
Q,
append: as @ bs,
select: l[i],
mklist: mklist(n;f),
le_int: i z j,
btrue: tt,
bfalse: ff,
prop: 
,
so_lambda: 
x.t[x],
so_lambda: x y.t[x; y],
so_apply: x[s],
so_apply: x[s1;s2],
subtype: S 
T
Lemmas :
uall_wf,
squash_wf,
valueall-type_wf,
eclass_wf,
es-E_wf,
event-ordering+_inc,
event-ordering+_wf,
normal-locally-programmable_wf,
primed-class_wf
\mforall{}[Info:\{Info:Type| \mdownarrow{}Info\} ]
\mforall{}A:\{T:Type| valueall-type(T)\}
\mforall{}[X:EClass(A)]
\mforall{}Xpr:NormalLProgrammable(A;X). (prior-prc(A;Xpr) \mmember{} NormalLProgrammable(A;Prior(X)))
Date html generated:
2011_08_16-PM-06_34_05
Last ObjectModification:
2011_08_13-PM-09_31_32
Home
Index