Nuprl Lemma : concat-lifting-loc-1-strict
∀[f,i:Top]. (f@ i {} ~ {})
Proof
Definitions occuring in Statement :
concat-lifting-loc-1: f@,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
sqequal: s ~ t,
empty-bag: {}
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
concat-lifting-loc-1: f@,
empty-bag: {},
concat-lifting1-loc: concat-lifting1-loc(f;bag;loc),
nil: [],
concat-lifting-loc: concat-lifting-loc(n;bags;loc;f),
it: ⋅,
concat-lifting: concat-lifting(n;f;bags),
concat-lifting-list: concat-lifting-list(n;bags),
lifting-gen-list-rev: lifting-gen-list-rev(n;bags),
bag-union: bag-union(bbs),
eq_int: (i =z j),
single-bag: {x},
bag-combine: ⋃x∈bs.f[x],
ifthenelse: if b then t else f fi ,
concat: concat(ll),
append: as @ bs,
btrue: tt,
bfalse: ff,
cons: [a / b],
bag-map: bag-map(f;bs),
reduce: reduce(f;k;as),
map: map(f;as),
list_ind: list_ind,
bottom: ⊥,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
implies: P ⇒ Q,
prop: ℙ,
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
top: Top,
strict4: strict4(F),
and: P ∧ Q,
all: ∀x:A. B[x],
has-value: (a)↓,
guard: {T},
or: P ∨ Q,
squash: ↓T
Latex:
\mforall{}[f,i:Top]. (f@ i \{\} \msim{} \{\})
Date html generated:
2016_05_17-AM-09_15_51
Last ObjectModification:
2016_01_17-PM-11_14_20
Theory : classrel!lemmas
Home
Index