Nuprl Lemma : archive-condition-nil
∀[V:Type]. ∀A:Id List. ∀t:ℕ. ∀f:(V List) ⟶ V. ∀n:ℤ. ∀v:V. (archive-condition(V;A;t;f;n;v;[]) ⇐⇒ False)
Proof
Definitions occuring in Statement :
archive-condition: archive-condition(V;A;t;f;n;v;L),
Id: Id,
nil: [],
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
false: False,
function: x:A ⟶ B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
false: False,
member: t ∈ T,
prop: ℙ,
rev_implies: P ⇐ Q,
archive-condition: archive-condition(V;A;t;f;n;v;L),
exists: ∃x:A. B[x],
or: P ∨ Q,
top: Top,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
append: as @ bs,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
cons: [a / b],
uimplies: b supposing a,
sq_type: SQType(T),
guard: {T},
true: True
Latex:
\mforall{}[V:Type]
\mforall{}A:Id List. \mforall{}t:\mBbbN{}. \mforall{}f:(V List) {}\mrightarrow{} V. \mforall{}n:\mBbbZ{}. \mforall{}v:V. (archive-condition(V;A;t;f;n;v;[]) \mLeftarrow{}{}\mRightarrow{} False)
Date html generated:
2016_05_16-PM-00_37_03
Last ObjectModification:
2015_12_29-PM-01_33_51
Theory : event-ordering
Home
Index