Nuprl Lemma : iter_hdf_cons_lemma

bs,a,P:Top.  (P*([a bs]) fst(P(a))*(bs))


Proof




Definitions occuring in Statement :  iterate-hdataflow: P*(inputs) hdf-ap: X(a) cons: [a b] top: Top pi1: fst(t) all: x:A. B[x] sqequal: t
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T iterate-hdataflow: P*(inputs) top: Top so_lambda: λ2y.t[x; y] so_apply: x[s1;s2]

Latex:
\mforall{}bs,a,P:Top.    (P*([a  /  bs])  \msim{}  fst(P(a))*(bs))



Date html generated: 2016_05_16-AM-10_38_33
Last ObjectModification: 2015_12_28-PM-07_44_31

Theory : halting!dataflow


Home Index