Nuprl Lemma : st-ptr-wf2
∀[T:Id ⟶ Type]. ∀[tab:secret-table(T)]. ptr(tab) ∈ ℕ||tab|| supposing ↑isl(next(tab))
Proof
Definitions occuring in Statement :
st-next: next(tab),
st-ptr: ptr(tab),
st-length: ||tab|| ,
secret-table: secret-table(T),
Id: Id,
int_seg: {i..j-},
assert: ↑b,
isl: isl(x),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
st-next: next(tab),
st-ptr: ptr(tab),
st-length: ||tab|| ,
secret-table: secret-table(T),
pi1: fst(t),
pi2: snd(t),
st-atom: st-atom(tab;n),
nat: ℕ,
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
le: A ≤ B,
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
exposed-bfalse: exposed-bfalse,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
top: Top,
ifthenelse: if b then t else f fi ,
isl: isl(x),
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[T:Id {}\mrightarrow{} Type]. \mforall{}[tab:secret-table(T)]. ptr(tab) \mmember{} \mBbbN{}||tab|| supposing \muparrow{}isl(next(tab))
Date html generated:
2016_05_16-AM-10_01_49
Last ObjectModification:
2015_12_28-PM-09_30_38
Theory : new!event-ordering
Home
Index