Nuprl Lemma : iterate-Process_wf
∀[M:Type ─→ Type]
∀[msgs:pMsg(P.M[P]) List]. ∀[P:Process(P.M[P])]. (iterate-Process(P;msgs) ∈ Process(P.M[P]))
supposing Continuous+(P.M[P])
Proof
Definitions occuring in Statement :
iterate-Process: iterate-Process(P;msgs),
pMsg: pMsg(P.M[P]),
Process: Process(P.M[P]),
list: T List,
strong-type-continuous: Continuous+(T.F[T]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
Process_wf,
equal-wf-T-base,
colength_wf_list,
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,
nat_wf,
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,
pi1_wf_top,
Process-apply_wf,
subtype_rel_product,
top_wf,
subtype_top,
pExt_wf,
list_wf,
pMsg_wf,
strong-type-continuous_wf
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}[msgs:pMsg(P.M[P]) List]. \mforall{}[P:Process(P.M[P])]. (iterate-Process(P;msgs) \mmember{} Process(P.M[P]))
supposing Continuous+(P.M[P])
Date html generated:
2015_07_23-AM-11_07_20
Last ObjectModification:
2015_01_29-AM-00_10_20
Home
Index