Nuprl Lemma : iter_hdf_nil_lemma
∀P:Top. (P*([]) ~ P)
Proof
Definitions occuring in Statement :
iterate-hdataflow: P*(inputs),
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
iterate-hdataflow: P*(inputs),
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}P:Top. (P*([]) \msim{} P)
Date html generated:
2016_05_16-AM-10_38_30
Last ObjectModification:
2015_12_28-PM-07_44_33
Theory : halting!dataflow
Home
Index