Nuprl Lemma : cs-ref-map3-decided
∀[V:Type]
∀L:ts-reachable(consensus-ts3(V)). ∀v:V. ((COMMITED[v] ∈ L) ⇐⇒ cs-ref-map3(L) = Decided[v] ∈ consensus-state2(V))
Proof
Definitions occuring in Statement :
cs-ref-map3: cs-ref-map3(L),
consensus-ts3: consensus-ts3(T),
cs-commited: COMMITED[v],
consensus-state3: consensus-state3(T),
consensus-state2: consensus-state2(T),
cs-decided: Decided[v],
l_member: (x ∈ l),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
universe: Type,
equal: s = t ∈ T,
ts-reachable: ts-reachable(ts)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
ts-reachable: ts-reachable(ts),
consensus-ts3: consensus-ts3(T),
ts-type: ts-type(ts),
pi1: fst(t),
subtype_rel: A ⊆r B,
cs-ref-map3: cs-ref-map3(L),
let: let,
implies: P ⇒ Q,
prop: ℙ,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
iff: P ⇐⇒ Q,
uimplies: b supposing a,
true: True,
rev_implies: P ⇐ Q,
so_lambda: λ2x.t[x],
int_seg: {i..j-},
guard: {T},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
less_than: a < b,
squash: ↓T,
so_apply: x[s],
cons: [a / b],
nat: ℕ,
le: A ≤ B,
subtract: n - m,
less_than': less_than'(a;b),
listp: A List+,
bfalse: ff,
bool: 𝔹,
unit: Unit,
it: ⋅,
l_member: (x ∈ l),
cand: A c∧ B,
cs-is-committed: cs-is-committed(x),
isl: isl(x),
cs-commited: COMMITED[v],
cs-decided: Decided[v],
cs-ambivalent: AMBIVALENT,
consensus-state2: consensus-state2(T),
cs-predecided: PREDECIDED[v]
Latex:
\mforall{}[V:Type]
\mforall{}L:ts-reachable(consensus-ts3(V)). \mforall{}v:V. ((COMMITED[v] \mmember{} L) \mLeftarrow{}{}\mRightarrow{} cs-ref-map3(L) = Decided[v])
Date html generated:
2016_05_16-AM-11_52_51
Last ObjectModification:
2016_01_17-PM-03_54_56
Theory : event-ordering
Home
Index