Nuprl Lemma : dataflow-equiv_wf
∀[A,B:Type]. ∀[f,g:dataflow(A;B)]. (f ≡ g ∈ ℙ)
Proof
Definitions occuring in Statement :
dataflow-equiv: d1 ≡ d2,
dataflow: dataflow(A;B),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
dataflow-equiv: d1 ≡ d2,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[A,B:Type]. \mforall{}[f,g:dataflow(A;B)]. (f \mequiv{} g \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-10_21_53
Last ObjectModification:
2015_12_29-PM-05_28_41
Theory : process-model
Home
Index