Nuprl Lemma : disjoint-union-class-nlp
A,B:{T:
'| valueall-type(T)} .
[X:EClass(A)]. [Y:EClass(B)].
(NormalLProgrammable'(A;X) 
NormalLProgrammable'(B;Y) NormalLProgrammable'(A + B;X + Y))
Proof not projected
Definitions occuring in Statement :
disjoint-union-class: X + Y,
Message: Message,
normal-locally-programmable: NormalLProgrammable(A;X),
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
all: x:A. B[x],
implies: P Q,
set: {x:A| B[x]} ,
union: left + right,
universe: Type,
valueall-type: valueall-type(T)
Definitions :
all: x:A. B[x],
uall: [x:A]. B[x],
eclass: EClass(A[eo; e]),
implies: P Q,
disjoint-union-class: X + Y,
or: P 
Q,
squash: 
T,
and: P 
Q,
empty-bag: {},
member: t 
T,
true: True,
ifthenelse: if b then t else f fi ,
bag-null: bag-null(bs),
bag-map: bag-map(f;bs),
guard: {T},
map: map(f;as),
null: null(as),
btrue: tt,
ycomb: Y,
prop: 
,
cand: A c B,
sq_stable: SqStable(P),
subtype: S 
T
Lemmas :
simple-comb-2-nlp,
union-valueall-type,
sq_stable__valueall-type,
valueall-type_wf,
ifthenelse_wf,
bag-null_wf,
bag_wf,
bag-map_wf,
empty-bag_wf,
squash_wf,
normal-locally-programmable_wf,
Message_wf,
event-ordering+_wf,
es-E_wf,
event-ordering+_inc
\mforall{}A,B:\{T:\mBbbU{}'| valueall-type(T)\} .
\mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)].
(NormalLProgrammable'(A;X) {}\mRightarrow{} NormalLProgrammable'(B;Y) {}\mRightarrow{} NormalLProgrammable'(A + B;X + Y))
Date html generated:
2011_10_20-PM-03_39_14
Last ObjectModification:
2011_10_04-AM-10_35_53
Home
Index