Nuprl Lemma : cs-ref-map-constraints_wf
∀[V:Type]. ∀[A:Id List]. ∀[W:{a:Id| (a ∈ A)} List List]. ∀[f:ConsensusState ⟶ (consensus-state3(V) List)].
(cs-ref-map-constraints(V;A;W;f) ∈ ℙ)
Proof
Definitions occuring in Statement :
cs-ref-map-constraints: cs-ref-map-constraints(V;A;W;f),
consensus-state4: ConsensusState,
consensus-state3: consensus-state3(T),
Id: Id,
l_member: (x ∈ l),
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
cs-ref-map-constraints: cs-ref-map-constraints(V;A;W;f),
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
nat: ℕ,
all: ∀x:A. B[x],
so_apply: x[s],
exists: ∃x:A. B[x],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
uimplies: b supposing a,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
top: Top
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[W:\{a:Id| (a \mmember{} A)\} List List].
\mforall{}[f:ConsensusState {}\mrightarrow{} (consensus-state3(V) List)].
(cs-ref-map-constraints(V;A;W;f) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-PM-00_06_35
Last ObjectModification:
2016_01_17-PM-03_53_42
Theory : event-ordering
Home
Index