Nuprl Lemma : three-consensus-ref-map_wf
∀[V:Type]. ∀[A:Id List]. ∀[t:ℕ+]. ∀[f:(V List) ⟶ V]. ∀[v0:V]. ∀[W:{a:Id| (a ∈ A)} List List].
(three-consensus-ref-map(v0;t;f) ∈ ts-type(three-consensus-ts(V;A;t;f)) ⟶ ts-type(consensus-ts6(V;A;W)))
Proof
Definitions occuring in Statement :
three-consensus-ref-map: three-consensus-ref-map(v0;t;f),
three-consensus-ts: three-consensus-ts(V;A;t;f),
consensus-ts6: consensus-ts6(V;A;W),
Id: Id,
l_member: (x ∈ l),
list: T List,
nat_plus: ℕ+,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type,
ts-type: ts-type(ts)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
three-consensus-ref-map: three-consensus-ref-map(v0;t;f),
ts-type: ts-type(ts),
three-consensus-ts: three-consensus-ts(V;A;t;f),
pi1: fst(t),
consensus-ts6: consensus-ts6(V;A;W),
consensus-state6: consensus-state6(V;A),
all: ∀x:A. B[x],
prop: ℙ,
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[t:\mBbbN{}\msupplus{}]. \mforall{}[f:(V List) {}\mrightarrow{} V]. \mforall{}[v0:V]. \mforall{}[W:\{a:Id| (a \mmember{} A)\} List List].
(three-consensus-ref-map(v0;t;f) \mmember{} ts-type(three-consensus-ts(V;A;t;f))
{}\mrightarrow{} ts-type(consensus-ts6(V;A;W)))
Date html generated:
2016_05_16-PM-00_49_20
Last ObjectModification:
2015_12_29-PM-01_39_14
Theory : event-ordering
Home
Index