Nuprl Lemma : evalall-append-implies-list
∀[a,b:Base]. a ∈ rec-value() List supposing (evalall(a @ b))↓
Proof
Definitions occuring in Statement :
rec-value: rec-value(),
append: as @ bs,
list: T List,
has-value: (a)↓,
evalall: evalall(t),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
nat: ℕ,
false: False,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
guard: {T},
or: P ∨ Q,
append: as @ bs,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
nil: [],
it: ⋅,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
has-value: (a)↓,
uiff: uiff(P;Q)
Lemmas referenced :
evalall-append-implies-list-base,
list_wf,
base_wf,
nat_properties,
satisfiable-full-omega-tt,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
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,
less_than_wf,
has-value_wf_base,
list_subtype_base,
equal-wf-base,
nat_wf,
less_than_transitivity1,
less_than_irreflexivity,
list-cases,
list_ind_nil_lemma,
nil_wf,
rec-value_wf,
product_subtype_list,
spread_cons_lemma,
colength_wf_list,
intformeq_wf,
itermAdd_wf,
int_formula_prop_eq_lemma,
int_term_value_add_lemma,
equal-wf-T-base,
decidable__le,
intformnot_wf,
int_formula_prop_not_lemma,
le_wf,
equal_wf,
subtract_wf,
itermSubtract_wf,
int_term_value_subtract_lemma,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
decidable__equal_int,
list_ind_cons_lemma,
cons_wf,
evalall-cons,
rec-value-evalall
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
independent_isectElimination,
hypothesis,
equalityTransitivity,
equalitySymmetry,
lambdaFormation,
setElimination,
rename,
sqequalRule,
intWeakElimination,
natural_numberEquality,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
independent_functionElimination,
axiomEquality,
baseApply,
closedConclusion,
baseClosed,
applyEquality,
because_Cache,
unionElimination,
promote_hyp,
hypothesis_subsumption,
productElimination,
applyLambdaEquality,
dependent_set_memberEquality,
addEquality,
instantiate,
cumulativity,
imageElimination,
callbyvalueCallbyvalue,
callbyvalueReduce
Latex:
\mforall{}[a,b:Base]. a \mmember{} rec-value() List supposing (evalall(a @ b))\mdownarrow{}
Date html generated:
2017_04_17-AM-09_07_42
Last ObjectModification:
2017_02_27-PM-05_15_09
Theory : rec_values
Home
Index