Nuprl Lemma : st-lookup_wf
∀[T:Id ─→ Type]. ∀[tab:secret-table(T)]. ∀[x:Atom1]. (st-lookup(tab;x) ∈ ℕ + Atom1 × data(T)?)
Proof
Definitions occuring in Statement :
st-lookup: st-lookup(tab;x),
secret-table: secret-table(T),
data: data(T),
Id: Id,
nat: ℕ,
atom: Atom$n,
uall: ∀[x:A]. B[x],
unit: Unit,
member: t ∈ T,
function: x:A ─→ B[x],
product: x:A × B[x],
union: left + right,
universe: Type
Lemmas :
let_wf,
bor_wf,
lt_int_wf,
le_int_wf,
bool_wf,
eqtt_to_assert,
iff_transitivity,
assert_wf,
or_wf,
less_than_wf,
le_wf,
iff_weakening_uiff,
assert_of_bor,
assert_of_lt_int,
assert_of_le_int,
it_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
decidable__lt,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
add-swap,
add-commutes,
add_functionality_wrt_le,
le-add-cancel,
lelt_wf,
secret-table_wf,
Id_wf,
mu_wf,
btrue_wf,
eq_atom_wf1,
data_wf,
nat_wf,
true_wf,
add-mul-special,
zero-mul,
add-zero,
add-associates
\mforall{}[T:Id {}\mrightarrow{} Type]. \mforall{}[tab:secret-table(T)]. \mforall{}[x:Atom1]. (st-lookup(tab;x) \mmember{} \mBbbN{} + Atom1 \mtimes{} data(T)?)
Date html generated:
2015_07_17-AM-08_56_39
Last ObjectModification:
2015_01_27-PM-01_04_59
Home
Index