Nuprl Lemma : dataflow-ext-eq
∀[A,B:Type]. dataflow(A;B) ≡ A ⟶ (dataflow(A;B) × B)
Proof
Definitions occuring in Statement :
dataflow: dataflow(A;B),
ext-eq: A ≡ B,
uall: ∀[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],
uimplies: b supposing a,
ext-eq: A ≡ B,
and: P ∧ Q,
subtype_rel: A ⊆r B
Latex:
\mforall{}[A,B:Type]. dataflow(A;B) \mequiv{} A {}\mrightarrow{} (dataflow(A;B) \mtimes{} B)
Date html generated:
2016_05_17-AM-10_19_24
Last ObjectModification:
2015_12_29-PM-05_30_25
Theory : process-model
Home
Index