Nuprl Lemma : cp-kinds_wf

[cp:ClassProgram(Top)]. (cp-kinds(cp) ∈ i:{i:Id| (i ∈ cp-domain(cp))}  ⟶ ({k:Knd| ↑hasloc(k;i)}  List))


Proof




Definitions occuring in Statement :  cp-kinds: cp-kinds(cp) cp-domain: cp-domain(cp) class-program: ClassProgram(T) hasloc: hasloc(k;i) Knd: Knd Id: Id l_member: (x ∈ l) list: List assert: b uall: [x:A]. B[x] top: Top member: t ∈ T set: {x:A| B[x]}  function: x:A ⟶ B[x]
Definitions unfolded in proof :  cp-kinds: cp-kinds(cp) cp-domain: cp-domain(cp) class-program: ClassProgram(T) uall: [x:A]. B[x] member: t ∈ T all: x:A. B[x] subtype_rel: A ⊆B so_lambda: λ2x.t[x] prop: uimplies: supposing a so_apply: x[s] top: Top iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q implies:  Q fpf-domain: fpf-domain(f) spreadn: spread6

Latex:
\mforall{}[cp:ClassProgram(Top)].  (cp-kinds(cp)  \mmember{}  i:\{i:Id|  (i  \mmember{}  cp-domain(cp))\}    {}\mrightarrow{}  (\{k:Knd|  \muparrow{}hasloc(k;i)\}    L\000Cist))



Date html generated: 2016_05_16-PM-00_55_47
Last ObjectModification: 2015_12_29-PM-01_42_29

Theory : event-ordering


Home Index