Nuprl Lemma : listify-append
[T:Type]. [m,n:
]. [f:{m..n
} 
T]. [i:{i:| (m 
i) 
(i n)} ].
(listify(f;m;n) = (listify(f;m;i) @ listify(f;i;n)))
Proof not projected
Definitions occuring in Statement :
listify: listify(f;m;n),
append: as @ bs,
int_seg: {i..j},
uall: [x:A]. B[x],
le: A B,
and: P Q,
set: {x:A| B[x]} ,
function: x:A B[x],
list: type List,
int: ,
universe: Type,
equal: s = t
Lemmas :
iff_weakening_uiff,
iff_functionality_wrt_iff,
iff_imp_equal_bool,
ycomb-unroll,
bool_subtype_base,
bfalse_wf,
subtype_rel_self,
int_seg_properties,
subtype_rel_function,
l_member_wf,
list-subtype,
intensional-universe_wf,
subtype_rel_wf,
bnot_wf,
assert_wf,
lt_int_wf,
bool_wf,
le_int_wf,
assert_of_lt_int,
bnot_of_le_int,
assert_functionality_wrt_uiff,
eqff_to_assert,
uiff_transitivity,
assert_of_le_int,
eqtt_to_assert,
list_subtype_base,
subtype_base_sq,
int_subtype_base,
nat_ind_tp,
nat_wf,
member_wf,
le_wf,
not_wf,
false_wf,
iff_wf,
rev_implies_wf,
int_seg_wf,
listify_wf,
append_wf,
squash_wf,
true_wf,
nat_properties,
ge_wf
\mforall{}[T:Type]. \mforall{}[m,n:\mBbbZ{}]. \mforall{}[f:\{m..n\msupminus{}\} {}\mrightarrow{} T]. \mforall{}[i:\{i:\mBbbZ{}| (m \mleq{} i) \mwedge{} (i \mleq{} n)\} ].
(listify(f;m;n) = (listify(f;m;i) @ listify(f;i;n)))
Date html generated:
2012_02_20-PM-05_59_01
Last ObjectModification:
2012_02_02-PM-02_30_34
Home
Index