Nuprl Lemma : parallel-class-program-wf-hdf
∀[A,B:Type]. ∀[Xpr,Ypr:Id ⟶ hdataflow(A;B)]. (Xpr || Ypr ∈ Id ⟶ hdataflow(A;B)) supposing valueall-type(B)
Proof
Definitions occuring in Statement :
parallel-class-program: X || Y,
hdataflow: hdataflow(A;B),
Id: Id,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
parallel-class-program: X || Y
Latex:
\mforall{}[A,B:Type].
\mforall{}[Xpr,Ypr:Id {}\mrightarrow{} hdataflow(A;B)]. (Xpr || Ypr \mmember{} Id {}\mrightarrow{} hdataflow(A;B)) supposing valueall-type(B)
Date html generated:
2016_05_17-AM-09_08_42
Last ObjectModification:
2015_12_29-PM-03_35_31
Theory : local!classes
Home
Index