Nuprl Lemma : iterate-stateless-dataflow
∀[L:Top List]. ∀[f:Top ⟶ Top]. (stateless-dataflow(m.f[m])*(L) ~ stateless-dataflow(m.f[m]))
Proof
Definitions occuring in Statement :
iterate-dataflow: P*(inputs),
stateless-dataflow: stateless-dataflow(m.f[m]),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
function: x:A ⟶ B[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
or: P ∨ Q,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
decidable: Dec(P),
nil: [],
it: ⋅,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
pi1: fst(t)
Latex:
\mforall{}[L:Top List]. \mforall{}[f:Top {}\mrightarrow{} Top]. (stateless-dataflow(m.f[m])*(L) \msim{} stateless-dataflow(m.f[m]))
Date html generated:
2016_05_17-AM-10_21_40
Last ObjectModification:
2016_01_18-AM-00_19_28
Theory : process-model
Home
Index