Nuprl Lemma : dataflow-equiv_inversion
∀[A,B:Type]. ∀[f,g:dataflow(A;B)]. g ≡ f supposing f ≡ g
Proof
Definitions occuring in Statement :
dataflow-equiv: d1 ≡ d2,
dataflow: dataflow(A;B),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
dataflow-equiv: d1 ≡ d2,
all: ∀x:A. B[x],
prop: ℙ
Latex:
\mforall{}[A,B:Type]. \mforall{}[f,g:dataflow(A;B)]. g \mequiv{} f supposing f \mequiv{} g
Date html generated:
2016_05_17-AM-10_22_03
Last ObjectModification:
2015_12_29-PM-05_28_32
Theory : process-model
Home
Index