Nuprl Lemma : assert-in-missing
∀i:ℤ. ∀missing:ℤ List. ((↑in-missing(i;missing)) ⇒ (i ∈ missing))
Proof
Definitions occuring in Statement :
in-missing: in-missing(i;missing),
l_member: (x ∈ l),
list: T List,
assert: ↑b,
all: ∀x:A. B[x],
implies: P ⇒ Q,
int: ℤ
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s],
false: False,
assert: ↑b,
ifthenelse: if b then t else f fi ,
in-missing: in-missing(i;missing),
reduce: reduce(f;k;as),
list_ind: list_ind,
nil: [],
it: ⋅,
bfalse: ff,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
top: Top,
uiff: uiff(P;Q),
uimplies: b supposing a,
or: P ∨ Q,
guard: {T}
Latex:
\mforall{}i:\mBbbZ{}. \mforall{}missing:\mBbbZ{} List. ((\muparrow{}in-missing(i;missing)) {}\mRightarrow{} (i \mmember{} missing))
Date html generated:
2016_05_17-PM-01_44_42
Last ObjectModification:
2015_12_28-PM-08_52_34
Theory : datatype-signatures
Home
Index