Nuprl Lemma : kindcase_wf

[B:Type]. ∀[k:Knd]. ∀[f:Id ⟶ B]. ∀[g:IdLnk ⟶ Id ⟶ B].  (kindcase(k;a.f[a];l,t.g[l;t]) ∈ B)


Proof




Definitions occuring in Statement :  kindcase: kindcase(k;a.f[a];l,t.g[l; t]) Knd: Knd IdLnk: IdLnk Id: Id uall: [x:A]. B[x] so_apply: x[s1;s2] so_apply: x[s] member: t ∈ T function: x:A ⟶ B[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T Knd: Knd kindcase: kindcase(k;a.f[a];l,t.g[l; t]) tagof: tag(k) lnk: lnk(k) actof: act(k) islocal: islocal(k) isl: isl(x) outr: outr(x) outl: outl(x) bnot: ¬bb ifthenelse: if then else fi  btrue: tt pi1: fst(t) pi2: snd(t) bfalse: ff so_apply: x[s1;s2] so_apply: x[s]

Latex:
\mforall{}[B:Type].  \mforall{}[k:Knd].  \mforall{}[f:Id  {}\mrightarrow{}  B].  \mforall{}[g:IdLnk  {}\mrightarrow{}  Id  {}\mrightarrow{}  B].    (kindcase(k;a.f[a];l,t.g[l;t])  \mmember{}  B)



Date html generated: 2016_05_16-AM-10_55_23
Last ObjectModification: 2015_12_29-AM-09_08_21

Theory : event-ordering


Home Index