Nuprl Lemma : list-to-fun_wf
∀[T:Type]. ∀[L:T List]. (list-to-fun(L) ∈ ℕ||L|| ⟶ T)
Proof
Definitions occuring in Statement :
list-to-fun: list-to-fun(L),
length: ||as||,
list: T List,
int_seg: {i..j-},
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,
list-to-fun: list-to-fun(L),
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
less_than: a < b,
squash: ↓T
Lemmas referenced :
list_wf,
int_seg_wf,
int_formula_prop_less_lemma,
intformless_wf,
decidable__lt,
int_formula_prop_wf,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__le,
length_wf,
int_seg_properties,
select_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lambdaEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
setElimination,
rename,
hypothesis,
independent_isectElimination,
natural_numberEquality,
productElimination,
dependent_functionElimination,
unionElimination,
dependent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
because_Cache,
imageElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[L:T List]. (list-to-fun(L) \mmember{} \mBbbN{}||L|| {}\mrightarrow{} T)
Date html generated:
2016_05_15-PM-10_33_02
Last ObjectModification:
2016_01_16-PM-04_31_56
Theory : minimal-first-order-logic
Home
Index