Nuprl Lemma : AccumComb_wf
[A,B:Type]. [x:B]. [f:B 
A B]. (AccumComb(A;B;f;x) 
CombinatorDef)
Proof not projected
Definitions occuring in Statement :
AccumComb: AccumComb(A;B;f;x),
combinator-def: CombinatorDef,
uall: [x:A]. B[x],
member: t T,
function: x:A B[x],
universe: Type
Definitions :
uall: [x:A]. B[x],
member: t T,
AccumComb: AccumComb(A;B;f;x),
ifthenelse: if b then t else f fi ,
eq_int: (i =
j),
prop: 
,
so_lambda: 
x.t[x],
so_lambda: x y.t[x; y],
label: ...$L... t,
all: x:A. B[x],
implies: P 
Q,
btrue: tt,
bfalse: ff,
guard: {T},
so_apply: x[s],
so_apply: x[s1;s2],
bool: 
,
nat: 
,
unit: Unit,
uimplies: b supposing a,
uiff: uiff(P;Q),
and: P 
Q,
it: 
Lemmas :
RecComb1_wf,
subtype_rel_wf,
eq_int_wf,
bag-size_wf,
nat_wf,
bool_wf,
uiff_transitivity,
equal_wf,
assert_wf,
eqtt_to_assert,
assert_of_eq_int,
single-bag_wf,
bag-only_wf,
subtype_rel_bag,
bnot_wf,
not_wf,
eqff_to_assert,
assert_of_bnot,
not_functionality_wrt_uiff,
bag_wf,
empty-bag_wf
\mforall{}[A,B:Type]. \mforall{}[x:B]. \mforall{}[f:B {}\mrightarrow{} A {}\mrightarrow{} B]. (AccumComb(A;B;f;x) \mmember{} CombinatorDef)
Date html generated:
2012_01_23-PM-01_32_23
Last ObjectModification:
2011_12_30-PM-09_17_57
Home
Index