Nuprl Lemma : pv11_p1_valid-proposals_wf
∀[Cmd:{T:Type| valueall-type(T)} ]
∀f:pv11_p1_headers_type{i:l}(Cmd). ∀es:EO+(Message(f)). ∀e:E. ∀ps:(ℤ × Cmd) List.
(pv11_p1_valid-proposals(Cmd;es;e;ps;f) ∈ ℙ)
Proof
Definitions occuring in Statement :
pv11_p1_valid-proposals: pv11_p1_valid-proposals(Cmd;es;e;L;f),
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
Message: Message(f),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
valueall-type: valueall-type(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
product: x:A × B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
member: t ∈ T,
pv11_p1_headers_type: pv11_p1_headers_type{i:l}(Cmd),
subtype_rel: A ⊆r B,
listp: A List+,
name: Name,
vatype: ValueAllType,
prop: ℙ,
and: P ∧ Q,
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,
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
less_than: a < b,
squash: ↓T,
length: ||as||,
list_ind: list_ind,
pv11_p1_headers: pv11_p1_headers(),
cons: [a / b],
nil: [],
it: ⋅,
true: True,
select: L[n],
subtract: n - m,
uimplies: b supposing a,
guard: {T},
rev_implies: P ⇐ Q,
pv11_p1_headers_fun: pv11_p1_headers_fun(Cmd),
name_eq: name_eq(x;y),
name-deq: NameDeq,
list-deq: list-deq(eq),
band: p ∧b q,
ifthenelse: if b then t else f fi ,
atom-deq: AtomDeq,
eq_atom: x =a y,
bfalse: ff,
btrue: tt,
null: null(as),
pv11_p1_valid-proposals: pv11_p1_valid-proposals(Cmd;es;e;L;f)
Latex:
\mforall{}[Cmd:\{T:Type| valueall-type(T)\} ]
\mforall{}f:pv11\_p1\_headers\_type\{i:l\}(Cmd). \mforall{}es:EO+(Message(f)). \mforall{}e:E. \mforall{}ps:(\mBbbZ{} \mtimes{} Cmd) List.
(pv11\_p1\_valid-proposals(Cmd;es;e;ps;f) \mmember{} \mBbbP{})
Date html generated:
2016_05_17-PM-04_10_13
Last ObjectModification:
2016_01_18-AM-11_14_27
Theory : paxos!synod
Home
Index