Nuprl Lemma : locknd-spread_wf2
∀[T:Type]. ∀[P:i:Id ⟶ k:{k:Knd| ↑hasloc(k;i)} ⟶ T]. ∀[ik:LocKnd]. (let i,k:LocKnd = ik in P[i;k] ∈ T)
Proof
Definitions occuring in Statement :
locknd-spread: let i,k:LocKnd = ik in P[i; k],
LocKnd: LocKnd,
hasloc: hasloc(k;i),
Knd: Knd,
Id: Id,
assert: ↑b,
uall: ∀[x:A]. B[x],
so_apply: x[s1;s2],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
locknd-spread: let i,k:LocKnd = ik in P[i; k],
LocKnd: LocKnd,
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_apply: x[s1;s2],
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[T:Type]. \mforall{}[P:i:Id {}\mrightarrow{} k:\{k:Knd| \muparrow{}hasloc(k;i)\} {}\mrightarrow{} T]. \mforall{}[ik:LocKnd].
(let i,k:LocKnd = ik in P[i;k] \mmember{} T)
Date html generated:
2016_05_16-AM-11_00_48
Last ObjectModification:
2015_12_29-AM-09_10_41
Theory : event-ordering
Home
Index