Nuprl Lemma : cs-knowledge-precondition_wf
∀[V:Type]. ∀[A:Id List]. ∀[W:{a:Id| (a ∈ A)} List List]. ∀[i:ℤ]. ∀[v:V]. ∀[s:b:Id fp-> ℤ × (ℤ × V + Top)].
(may consider v in inning i based on knowledge (s) ∈ ℙ)
Proof
Definitions occuring in Statement :
cs-knowledge-precondition: may consider v in inning i based on knowledge (s),
fpf: a:A fp-> B[a],
Id: Id,
l_member: (x ∈ l),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
member: t ∈ T,
set: {x:A| B[x]} ,
product: x:A × B[x],
union: left + right,
int: ℤ,
universe: Type
Definitions unfolded in proof :
cs-knowledge-precondition: may consider v in inning i based on knowledge (s),
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
so_apply: x[s],
uimplies: b supposing a,
top: Top,
pi2: snd(t),
outl: outl(x),
isl: isl(x),
not: ¬A,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
exists: ∃x:A. B[x],
guard: {T}
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[W:\{a:Id| (a \mmember{} A)\} List List]. \mforall{}[i:\mBbbZ{}]. \mforall{}[v:V].
\mforall{}[s:b:Id fp-> \mBbbZ{} \mtimes{} (\mBbbZ{} \mtimes{} V + Top)].
(may consider v in inning i based on knowledge (s) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-PM-00_20_25
Last ObjectModification:
2015_12_29-PM-01_26_25
Theory : event-ordering
Home
Index