Nuprl Lemma : sqequal-append-cbva-weak2
∀[a:Top List]. ∀[b,F:Top]. (let x ⟵ a @ b in F[x] ~ let u ⟵ a in let v ⟵ b in let x ⟵ u @ v in F[x])
Proof
Definitions occuring in Statement :
append: as @ bs,
list: T List,
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
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),
append: as @ bs,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
callbyvalueall: callbyvalueall,
evalall: evalall(t),
has-valueall: has-valueall(a),
has-value: (a)↓,
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
strict4: strict4(F)
Latex:
\mforall{}[a:Top List]. \mforall{}[b,F:Top].
(let x \mleftarrow{}{} a @ b
in F[x] \msim{} let u \mleftarrow{}{} a
in let v \mleftarrow{}{} b
in let x \mleftarrow{}{} u @ v
in F[x])
Date html generated:
2016_05_16-AM-10_51_10
Last ObjectModification:
2016_01_17-AM-11_09_30
Theory : halting!dataflow
Home
Index