Nuprl Lemma : decidable__cs-inning-committable

[V:Type]
  ((∀v,v':V.  Dec(v v' ∈ V))
   (∀A:Id List. ∀W:{a:Id| (a ∈ A)}  List List. ∀s:ConsensusState. ∀i:ℤ. ∀v:V.
        Dec(in state s, inning could commit )))


Proof




Definitions occuring in Statement :  cs-inning-committable: in state s, inning could commit  consensus-state4: ConsensusState Id: Id l_member: (x ∈ l) list: List decidable: Dec(P) uall: [x:A]. B[x] all: x:A. B[x] implies:  Q set: {x:A| B[x]}  int: universe: Type equal: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] implies:  Q all: x:A. B[x] cs-inning-committable: in state s, inning could commit  member: t ∈ T prop: so_lambda: λ2x.t[x] and: P ∧ Q or: P ∨ Q so_apply: x[s] iff: ⇐⇒ Q rev_implies:  Q

Latex:
\mforall{}[V:Type]
    ((\mforall{}v,v':V.    Dec(v  =  v'))
    {}\mRightarrow{}  (\mforall{}A:Id  List.  \mforall{}W:\{a:Id|  (a  \mmember{}  A)\}    List  List.  \mforall{}s:ConsensusState.  \mforall{}i:\mBbbZ{}.  \mforall{}v:V.
                Dec(in  state  s,  inning  i  could  commit  v  )))



Date html generated: 2016_05_16-PM-00_00_19
Last ObjectModification: 2015_12_29-PM-01_21_45

Theory : event-ordering


Home Index