Nuprl Lemma : es-decl-set-da_wf
∀[dd:DeclSet]. ∀[i:Id]. da(dd;i) ∈ k:{k:Knd| ↑hasloc(k;i)} fp-> Type supposing (i ∈ |dd|)
Proof
Definitions occuring in Statement :
es-decl-set-da: da(dd;i),
es-decl-set-domain: |dd|,
es-decl-set: DeclSet,
fpf: a:A fp-> B[a],
hasloc: hasloc(k;i),
Knd: Knd,
Id: Id,
l_member: (x ∈ l),
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-decl-set: DeclSet,
es-decl-set-domain: |dd|,
pi1: fst(t),
es-decl-set-da: da(dd;i),
pi2: snd(t),
prop: ℙ
Latex:
\mforall{}[dd:DeclSet]. \mforall{}[i:Id]. da(dd;i) \mmember{} k:\{k:Knd| \muparrow{}hasloc(k;i)\} fp-> Type supposing (i \mmember{} |dd|)
Date html generated:
2016_05_16-PM-00_51_09
Last ObjectModification:
2015_12_29-PM-01_40_03
Theory : event-ordering
Home
Index