Nuprl Lemma : bind-class-program-eq-hdf
∀[Info,A,B:Type].
∀[xpr1,xpr2:Id ⟶ hdataflow(Info;A)]. ∀[ypr1,ypr2:A ⟶ Id ⟶ hdataflow(Info;B)].
(xpr1 >>= ypr1 = xpr2 >>= ypr2 ∈ (Id ⟶ hdataflow(Info;B))) supposing
((xpr1 = xpr2 ∈ (Id ⟶ hdataflow(Info;A))) and
(ypr1 = ypr2 ∈ (A ⟶ Id ⟶ hdataflow(Info;B))))
supposing valueall-type(B)
Proof
Definitions occuring in Statement :
bind-class-program: xpr >>= ypr,
hdataflow: hdataflow(A;B),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
function: 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,
bind-class-program: xpr >>= ypr,
squash: ↓T,
prop: ℙ
Latex:
\mforall{}[Info,A,B:Type].
\mforall{}[xpr1,xpr2:Id {}\mrightarrow{} hdataflow(Info;A)]. \mforall{}[ypr1,ypr2:A {}\mrightarrow{} Id {}\mrightarrow{} hdataflow(Info;B)].
(xpr1 >>= ypr1 = xpr2 >>= ypr2) supposing ((xpr1 = xpr2) and (ypr1 = ypr2))
supposing valueall-type(B)
Date html generated:
2016_05_17-AM-09_06_56
Last ObjectModification:
2016_01_17-PM-09_14_00
Theory : local!classes
Home
Index