Nuprl Lemma : new_23_sig_ReplicaState-classrel
∀[Cmd:ValueAllType]. ∀[notify,propose:Atom List]. ∀[slots:set-sig{i:l}(ℤ)].
∀[f:new_23_sig_headers_type{i:l}(Cmd;notify;propose)].
  ∀es:EO+(Message(f)). ∀e:E. ∀v:set-sig-set(slots).
    (v ∈ new_23_sig_ReplicaState(Cmd;notify;propose;slots;f)(e)
    ⇐⇒ v = new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e) ∈ set-sig-set(slots))
Proof
Definitions occuring in Statement : 
new_23_sig_ReplicaStateFun: new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e), 
new_23_sig_ReplicaState: new_23_sig_ReplicaState(Cmd;notify;propose;slots;f), 
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose), 
set-sig-set: set-sig-set(s), 
set-sig: set-sig{i:l}(Item), 
Message: Message(f), 
classrel: v ∈ X(e), 
event-ordering+: EO+(Info), 
es-E: E, 
list: T List, 
vatype: ValueAllType, 
uall: ∀[x:A]. B[x], 
all: ∀x:A. B[x], 
iff: P ⇐⇒ Q, 
int: ℤ, 
atom: Atom, 
equal: s = t ∈ T
Definitions unfolded in proof : 
vatype: ValueAllType, 
uall: ∀[x:A]. B[x], 
all: ∀x:A. B[x], 
member: t ∈ T, 
new_23_sig_headers_type: new_23_sig_headers_type{i:l}(Cmd;notify;propose), 
name: Name, 
subtype_rel: A ⊆r B, 
prop: ℙ, 
and: P ∧ Q, 
listp: A List+, 
implies: P ⇒ Q, 
sq_stable: SqStable(P), 
l_all: (∀x∈L.P[x]), 
so_lambda: λ2x.t[x], 
so_apply: x[s], 
iff: P ⇐⇒ Q, 
new_23_sig_headers: new_23_sig_headers(notify;propose), 
rev_implies: P ⇐ Q, 
guard: {T}, 
or: P ∨ Q, 
uimplies: b supposing a, 
new_23_sig_headers_fun: new_23_sig_headers_fun(Cmd;notify;propose), 
bool: 𝔹, 
unit: Unit, 
it: ⋅, 
btrue: tt, 
uiff: uiff(P;Q), 
ifthenelse: if b then t else f fi , 
cand: A c∧ B, 
new_23_sig_headers_no_rep: new_23_sig_headers_no_rep(notify;propose), 
squash: ↓T, 
no_repeats: no_repeats(T;l), 
nat: ℕ, 
le: A ≤ B, 
less_than': less_than'(a;b), 
false: False, 
not: ¬A, 
length: ||as||, 
list_ind: list_ind, 
cons: [a / b], 
nil: [], 
less_than: a < b, 
true: True, 
ge: i ≥ j , 
satisfiable_int_formula: satisfiable_int_formula(fmla), 
exists: ∃x:A. B[x], 
top: Top, 
select: L[n], 
subtract: n - m, 
bfalse: ff, 
sq_type: SQType(T), 
bnot: ¬bb, 
assert: ↑b, 
name_eq: name_eq(x;y), 
name-deq: NameDeq, 
list-deq: list-deq(eq), 
band: p ∧b q, 
atom-deq: AtomDeq, 
eq_atom: x =a y, 
null: null(as), 
new_23_sig_ReplicaStateFun: new_23_sig_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e), 
rev_uimplies: rev_uimplies(P;Q), 
classrel: v ∈ X(e), 
bag-member: x ↓∈ bs
Latex:
\mforall{}[Cmd:ValueAllType].  \mforall{}[notify,propose:Atom  List].  \mforall{}[slots:set-sig\{i:l\}(\mBbbZ{})].
\mforall{}[f:new\_23\_sig\_headers\_type\{i:l\}(Cmd;notify;propose)].
    \mforall{}es:EO+(Message(f)).  \mforall{}e:E.  \mforall{}v:set-sig-set(slots).
        (v  \mmember{}  new\_23\_sig\_ReplicaState(Cmd;notify;propose;slots;f)(e)
        \mLeftarrow{}{}\mRightarrow{}  v  =  new\_23\_sig\_ReplicaStateFun(Cmd;notify;propose;slots;f;es;e))
Date html generated:
2016_05_17-PM-02_06_49
Last ObjectModification:
2016_01_18-AM-09_33_06
Theory : 2!3!consensus!with!signatures
Home
Index