Nuprl Lemma : reduce-map
∀[f,g,as,x:Top]. (reduce(λa,b. g[a;b];x;map(f;as)) ~ reduce(λa,b. g[f a;b];x;as))
Proof
Definitions occuring in Statement :
map: map(f;as),
reduce: reduce(f;k;as),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2],
apply: f a,
lambda: λx.A[x],
sqequal: s ~ t
Definitions unfolded in proof :
reduce: reduce(f;k;as),
map: map(f;as),
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
list_ind: list_ind,
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
so_apply: x[s1;s2],
fun_exp: f^n,
primrec: primrec(n;b;c),
so_lambda: λ2x.t[x],
so_apply: x[s],
decidable: Dec(P),
or: P ∨ Q,
nat_plus: ℕ+,
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
strict4: strict4(F),
has-value: (a)↓,
guard: {T},
squash: ↓T,
subtype_rel: A ⊆r B,
cons: [a / b],
so_lambda: λ2x y.t[x; y],
nil: [],
it: ⋅
Lemmas referenced :
cbv_bottom_lemma,
has-value-implies-dec-isaxiom-2,
lifting-strict-isaxiom,
top_wf,
has-value-implies-dec-ispair-2,
lifting-strict-ispair,
int_subtype_base,
cbv_sqle,
is-exception_wf,
has-value_wf_base,
lifting-strict-callbyvalue,
fun_exp_unroll_1,
int_term_value_subtract_lemma,
int_formula_prop_not_lemma,
itermSubtract_wf,
intformnot_wf,
subtract_wf,
decidable__le,
bottom-sqle,
strictness-callbyvalue,
strictness-apply,
base_wf,
less_than_wf,
ge_wf,
int_formula_prop_wf,
int_formula_prop_less_lemma,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_and_lemma,
intformless_wf,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformand_wf,
satisfiable-full-omega-tt,
nat_properties
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
thin,
sqequalSqle,
lambdaFormation,
fixpointLeast,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
independent_functionElimination,
axiomSqleEquality,
unionElimination,
dependent_set_memberEquality,
baseClosed,
callbyvalueCallbyvalue,
callbyvalueReduce,
baseApply,
closedConclusion,
callbyvalueExceptionCases,
inrFormation,
imageMemberEquality,
imageElimination,
exceptionSqequal,
inlFormation,
applyEquality,
sqleRule,
sqleReflexivity,
because_Cache,
divergentSqle,
sqequalAxiom
Latex:
\mforall{}[f,g,as,x:Top]. (reduce(\mlambda{}a,b. g[a;b];x;map(f;as)) \msim{} reduce(\mlambda{}a,b. g[f a;b];x;as))
Date html generated:
2016_05_14-PM-02_11_38
Last ObjectModification:
2016_01_15-AM-07_59_30
Theory : list_1
Home
Index