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
Lemmas :
or_wf,
exists_wf,
list_wf,
Id_wf,
l_member_wf,
all_wf,
assert_wf,
fpf-dom_wf,
id-deq_wf,
subtype-fpf2,
subtype_top,
top_wf,
equal-wf-base-T,
int_subtype_base,
fpf-ap_wf,
isl_wf,
spread_wf,
assert_elim,
and_wf,
equal_wf,
pi2_wf,
bfalse_wf,
btrue_neq_bfalse,
equal-wf-base,
false_wf,
fpf_wf
\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:
2015_07_17-AM-11_40_04
Last ObjectModification:
2015_01_28-AM-01_31_44
Home
Index