Nuprl Lemma : iterate-dataflow_wf

[A,B:Type]. ∀[P:dataflow(A;B)]. ∀[inputs:A List].  (P*(inputs) ∈ dataflow(A;B))


Proof




Definitions occuring in Statement :  iterate-dataflow: P*(inputs) dataflow: dataflow(A;B) list: List uall: [x:A]. B[x] member: t ∈ T universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T iterate-dataflow: P*(inputs) so_lambda: λ2y.t[x; y] subtype_rel: A ⊆B so_lambda: λ2x.t[x] so_apply: x[s] uimplies: supposing a all: x:A. B[x] top: Top so_apply: x[s1;s2]

Latex:
\mforall{}[A,B:Type].  \mforall{}[P:dataflow(A;B)].  \mforall{}[inputs:A  List].    (P*(inputs)  \mmember{}  dataflow(A;B))



Date html generated: 2016_05_17-AM-10_20_33
Last ObjectModification: 2015_12_29-PM-05_29_43

Theory : process-model


Home Index