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