Nuprl Lemma : cs-precondition_wf
∀[V:Type]. ∀[A:Id List]. ∀[W:{a:Id| (a ∈ A)} List List]. ∀[s:ConsensusState]. ∀[i:ℤ]. ∀[v:V].
(state s may consider v in inning i ∈ ℙ)
Proof
Definitions occuring in Statement :
cs-precondition: state s may consider v in inning i,
consensus-state4: ConsensusState,
Id: Id,
l_member: (x ∈ l),
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
set: {x:A| B[x]} ,
int: ℤ,
universe: Type
Definitions unfolded in proof :
cs-precondition: state s may consider v in inning i,
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,
so_apply: x[s]
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[W:\{a:Id| (a \mmember{} A)\} List List]. \mforall{}[s:ConsensusState]. \mforall{}[i:\mBbbZ{}]. \mforall{}[v:V].
(state s may consider v in inning i \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-11_55_45
Last ObjectModification:
2015_12_29-PM-01_18_30
Theory : event-ordering
Home
Index