Nuprl Lemma : fix_wf_dataflow
∀[A,B:Type]. ∀[F:⋂P:Type. (P ⟶ A ⟶ (P × B))]. (fix(F) ∈ dataflow(A;B))
Proof
Definitions occuring in Statement :
dataflow: dataflow(A;B),
uall: ∀[x:A]. B[x],
member: t ∈ T,
fix: fix(F),
isect: ⋂x:A. B[x],
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
dataflow: dataflow(A;B),
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[A,B:Type]. \mforall{}[F:\mcap{}P:Type. (P {}\mrightarrow{} A {}\mrightarrow{} (P \mtimes{} B))]. (fix(F) \mmember{} dataflow(A;B))
Date html generated:
2016_05_17-AM-10_19_32
Last ObjectModification:
2015_12_29-PM-05_30_22
Theory : process-model
Home
Index