Nuprl Lemma : iterate-stateless-dataflow

[L:Top List]. ∀[f:Top ─→ Top].  (stateless-dataflow(m.f[m])*(L) stateless-dataflow(m.f[m]))


Proof




Definitions occuring in Statement :  iterate-dataflow: P*(inputs) stateless-dataflow: stateless-dataflow(m.f[m]) list: List uall: [x:A]. B[x] top: Top so_apply: x[s] function: x:A ─→ B[x] sqequal: 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 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 iter_df_cons_lemma stateless_dataflow_ap_lemma

Latex:
\mforall{}[L:Top  List].  \mforall{}[f:Top  {}\mrightarrow{}  Top].    (stateless-dataflow(m.f[m])*(L)  \msim{}  stateless-dataflow(m.f[m]))



Date html generated: 2015_07_23-AM-11_06_20
Last ObjectModification: 2015_01_29-AM-00_11_28

Home Index