Nuprl Lemma : committed-inning0-reachable

[V:Type]. ∀[A:Id List]. ∀[W:{a:Id| (a ∈ A)}  List List].
  ∀[v:V]. a.<0, v> ∈ ts-reachable(consensus-ts4(V;A;W))) supposing ||W|| ≥ 


Proof




Definitions occuring in Statement :  consensus-ts4: consensus-ts4(V;A;W) fpf-single: v Id: Id l_member: (x ∈ l) length: ||as|| list: List uimplies: supposing a uall: [x:A]. B[x] ge: i ≥  member: t ∈ T set: {x:A| B[x]}  lambda: λx.A[x] pair: <a, b> natural_number: $n universe: Type ts-reachable: ts-reachable(ts)
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a consensus-ts4: consensus-ts4(V;A;W) ts-reachable: ts-reachable(ts) ts-init: ts-init(ts) ts-rel: ts-rel(ts) ts-type: ts-type(ts) pi1: fst(t) pi2: snd(t) subtype_rel: A ⊆B consensus-state4: ConsensusState so_lambda: λ2x.t[x] so_apply: x[s] prop: top: Top all: x:A. B[x] implies:  Q l_all: (∀x∈L.P[x]) l_contains: A ⊆ B bool: 𝔹 unit: Unit it: btrue: tt ifthenelse: if then else fi  uiff: uiff(P;Q) and: P ∧ Q iff: ⇐⇒ Q bfalse: ff exists: x:A. B[x] or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False not: ¬A rev_implies:  Q ge: i ≥  le: A ≤ B eq_id: b decidable: Dec(P) bor: p ∨bq consensus-rel: CR[x,y] infix_ap: y cs-inning: Inning(s;a) cs-estimate: Estimate(s;a) cand: c∧ B fpf-empty: fpf-domain: fpf-domain(f) true: True sq_stable: SqStable(P) squash: T fpf-single: v cs-precondition: state may consider in inning i cons: [a b] less_than': less_than'(a;b) cs-archive-blocked: in state s, ws' blocks ws from archiving in inning i satisfiable_int_formula: satisfiable_int_formula(fmla)

Latex:
\mforall{}[V:Type].  \mforall{}[A:Id  List].  \mforall{}[W:\{a:Id|  (a  \mmember{}  A)\}    List  List].
    \mforall{}[v:V].  (\mlambda{}a.ɘ,  0  :  v>  \mmember{}  ts-reachable(consensus-ts4(V;A;W)))  supposing  ||W||  \mgeq{}  1 



Date html generated: 2016_05_16-PM-00_07_46
Last ObjectModification: 2016_01_17-PM-03_58_32

Theory : event-ordering


Home Index