Nuprl Lemma : archive-condition-single
∀[V:Type]. ∀[A:Id List]. ∀[t:ℕ+]. ∀[f:(V List) ⟶ V]. ∀[L:consensus-rcv(V;A) List]. ∀[n:ℤ]. ∀[v:V].
∀[L1:consensus-rcv(V;A) List]. ∀[v1:V]. (¬archive-condition(V;A;t;f;n;v1;L1)) supposing L1 < L
supposing 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,
proper-iseg: L1 < L2,
list: T List,
nat_plus: ℕ+,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
function: x:A ⟶ B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
not: ¬A,
implies: P ⇒ Q,
false: False,
prop: ℙ,
subtype_rel: A ⊆r B,
nat_plus: ℕ+,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
all: ∀x:A. B[x],
top: Top
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[t:\mBbbN{}\msupplus{}]. \mforall{}[f:(V List) {}\mrightarrow{} V]. \mforall{}[L:consensus-rcv(V;A) List]. \mforall{}[n:\mBbbZ{}]. \mforall{}[v:V].
\mforall{}[L1:consensus-rcv(V;A) List]. \mforall{}[v1:V]. (\mneg{}archive-condition(V;A;t;f;n;v1;L1)) supposing L1 < L
supposing archive-condition(V;A;t;f;n;v;L)
Date html generated:
2016_05_16-PM-00_40_09
Last ObjectModification:
2016_01_17-PM-08_00_01
Theory : event-ordering
Home
Index