Nuprl Lemma : iterate-dataflow-append
∀[as1:Top List]. ∀[as2,P:Top]. (P*(as1 @ as2) ~ P*(as1)*(as2))
Proof
Definitions occuring in Statement :
iterate-dataflow: P*(inputs),
append: as @ bs,
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Lemmas :
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
top_wf,
equal-wf-T-base,
nat_wf,
colength_wf_list,
list_wf,
list-cases,
list_ind_nil_lemma,
iter_df_nil_lemma,
product_subtype_list,
spread_cons_lemma,
sq_stable__le,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-associates,
add-zero,
zero-add,
le-add-cancel,
decidable__le,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
add-commutes,
le_wf,
subtract_wf,
not-ge-2,
less-iff-le,
minus-minus,
add-swap,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
list_ind_cons_lemma,
iter_df_cons_lemma
Latex:
\mforall{}[as1:Top List]. \mforall{}[as2,P:Top]. (P*(as1 @ as2) \msim{} P*(as1)*(as2))
Date html generated:
2015_07_23-AM-11_05_51
Last ObjectModification:
2015_01_28-PM-11_35_26
Home
Index