Nuprl Lemma : nth_tl_map
∀[f:Top]. ∀[n:ℕ]. ∀[l:Top List]. (nth_tl(n;map(f;l)) ~ map(f;nth_tl(n;l)))
Proof
Definitions occuring in Statement :
nth_tl: nth_tl(n;as),
map: map(f;as),
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
not: ¬A,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
all: ∀x:A. B[x],
top: Top,
and: P ∧ Q,
prop: ℙ,
nth_tl: nth_tl(n;as),
le_int: i ≤z j,
lt_int: i <z j,
bnot: ¬bb,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt,
or: P ∨ Q,
cons: [a / b],
le: A ≤ B,
less_than': less_than'(a;b),
colength: colength(L),
nil: [],
it: ⋅,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
subtype_rel: A ⊆r B,
bool: 𝔹,
unit: Unit,
uiff: uiff(P;Q),
assert: ↑b,
rev_implies: P ⇐ Q,
iff: P ⇐⇒ Q
Lemmas referenced :
nat_properties,
full-omega-unsat,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
istype-int,
int_formula_prop_and_lemma,
istype-void,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
ge_wf,
istype-less_than,
subtract-1-ge-0,
istype-nat,
istype-top,
list_wf,
top_wf,
list-cases,
product_subtype_list,
colength-cons-not-zero,
colength_wf_list,
istype-false,
istype-le,
subtype_base_sq,
intformeq_wf,
int_formula_prop_eq_lemma,
set_subtype_base,
int_subtype_base,
spread_cons_lemma,
decidable__equal_int,
subtract_wf,
intformnot_wf,
itermSubtract_wf,
itermAdd_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
int_term_value_add_lemma,
decidable__le,
le_wf,
map_cons_lemma,
map_nil_lemma,
nth_tl_nil,
le_int_wf,
eqtt_to_assert,
assert_of_le_int,
eqff_to_assert,
bool_subtype_base,
bool_cases_sqequal,
bool_wf,
assert-bnot,
iff_weakening_uiff,
assert_wf,
reduce_tl_cons_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
Error :lambdaFormation_alt,
natural_numberEquality,
independent_isectElimination,
approximateComputation,
independent_functionElimination,
Error :dependent_pairFormation_alt,
Error :lambdaEquality_alt,
int_eqEquality,
dependent_functionElimination,
Error :isect_memberEquality_alt,
voidElimination,
sqequalRule,
independent_pairFormation,
Error :universeIsType,
axiomSqEquality,
Error :isectIsTypeImplies,
Error :inhabitedIsType,
Error :functionIsTypeImplies,
isect_memberFormation,
unionElimination,
promote_hyp,
hypothesis_subsumption,
productElimination,
Error :equalityIsType1,
because_Cache,
Error :dependent_set_memberEquality_alt,
instantiate,
equalityTransitivity,
equalitySymmetry,
applyLambdaEquality,
imageElimination,
Error :equalityIsType4,
baseApply,
closedConclusion,
baseClosed,
applyEquality,
intEquality,
equalityElimination,
cumulativity
Latex:
\mforall{}[f:Top]. \mforall{}[n:\mBbbN{}]. \mforall{}[l:Top List]. (nth\_tl(n;map(f;l)) \msim{} map(f;nth\_tl(n;l)))
Date html generated:
2019_06_20-PM-01_46_12
Last ObjectModification:
2018_11_01-PM-07_01_09
Theory : list_1
Home
Index