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
Lemmas :
all_wf,
list_wf,
equal_wf,
data-stream_wf,
dataflow_wf
Latex:
\mforall{}[A,B:Type]. \mforall{}[f,g:dataflow(A;B)]. (f \mequiv{} g \mmember{} \mBbbP{})
Date html generated:
2015_07_23-AM-11_06_27
Last ObjectModification:
2015_01_29-AM-00_11_11
Home
Index