Nuprl Lemma : kindcase-locl
∀[k:Knd]. ∀[f,g:Top]. kindcase(k;a.f[a];l,t.g[l;t]) ~ f[act(k)] supposing ↑islocal(k)
Proof
Definitions occuring in Statement :
kindcase: kindcase(k;a.f[a];l,t.g[l; t]),
actof: act(k),
islocal: islocal(k),
Knd: Knd,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2],
so_apply: x[s],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
Knd: Knd,
actof: act(k),
kindcase: kindcase(k;a.f[a];l,t.g[l; t]),
islocal: islocal(k),
isl: isl(x),
outr: outr(x),
bnot: ¬bb,
ifthenelse: if b then t else f fi ,
btrue: tt,
assert: ↑b,
bfalse: ff,
tagof: tag(k),
lnk: lnk(k),
outl: outl(x),
pi1: fst(t),
pi2: snd(t),
uimplies: b supposing a,
false: False,
prop: ℙ
Latex:
\mforall{}[k:Knd]. \mforall{}[f,g:Top]. kindcase(k;a.f[a];l,t.g[l;t]) \msim{} f[act(k)] supposing \muparrow{}islocal(k)
Date html generated:
2016_05_16-AM-10_55_25
Last ObjectModification:
2015_12_29-AM-09_08_23
Theory : event-ordering
Home
Index