Nuprl Lemma : archive-condition_wf
∀[V:Type]. ∀[A:Id List]. ∀[t:ℕ]. ∀[f:(V List) ⟶ V]. ∀[L:consensus-rcv(V;A) List]. ∀[n:ℤ]. ∀[v:V].
(archive-condition(V;A;t;f;n;v;L) ∈ ℙ)
Proof
Definitions occuring in Statement :
archive-condition: archive-condition(V;A;t;f;n;v;L),
consensus-rcv: consensus-rcv(V;A),
Id: Id,
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
archive-condition: archive-condition(V;A;t;f;n;v;L),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
top: Top,
all: ∀x:A. B[x],
nat: ℕ,
so_apply: x[s],
exists: ∃x:A. B[x],
or: P ∨ Q,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
ge: i ≥ j ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
implies: P ⇒ Q,
not: ¬A,
less_than: a < b,
le: A ≤ B,
assert: ↑b
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[t:\mBbbN{}]. \mforall{}[f:(V List) {}\mrightarrow{} V]. \mforall{}[L:consensus-rcv(V;A) List]. \mforall{}[n:\mBbbZ{}]. \mforall{}[v:V].
(archive-condition(V;A;t;f;n;v;L) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-PM-00_36_13
Last ObjectModification:
2016_01_17-PM-03_58_42
Theory : event-ordering
Home
Index