Nuprl Lemma : ml-revappend-sq
∀[T:Type]. ∀[as,bs:T List]. (ml-revappend(as;bs) ~ rev(as) + bs) supposing valueall-type(T)
Proof
Definitions occuring in Statement :
ml-revappend: ml-revappend(as;bs),
rev-append: rev(as) + bs,
list: T List,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
guard: {T},
prop: ℙ,
subtype_rel: A ⊆r B,
or: P ∨ Q,
ml-revappend: ml-revappend(as;bs),
top: Top,
ml_apply: f(x),
spreadcons: spreadcons,
callbyvalueall: callbyvalueall,
evalall: evalall(t),
nil: [],
it: ⋅,
ifthenelse: if b then t else f fi ,
btrue: tt,
has-value: (a)↓,
has-valueall: has-valueall(a),
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
squash: ↓T,
sq_stable: SqStable(P),
uiff: uiff(P;Q),
and: P ∧ Q,
le: A ≤ B,
not: ¬A,
less_than': less_than'(a;b),
true: True,
decidable: Dec(P),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
subtract: n - m,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
bfalse: ff
Lemmas referenced :
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
equal-wf-T-base,
nat_wf,
colength_wf_list,
list-cases,
rev_app_nil_lemma,
null_nil_lemma,
valueall-type-has-valueall,
list_wf,
list-valueall-type,
evalall-reduce,
product_subtype_list,
spread_cons_lemma,
sq_stable__le,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-associates,
add-zero,
zero-add,
le-add-cancel,
decidable__le,
false_wf,
not-le-2,
condition-implies-le,
minus-add,
minus-one-mul,
minus-one-mul-top,
add-commutes,
le_wf,
equal_wf,
subtract_wf,
not-ge-2,
less-iff-le,
minus-minus,
add-swap,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
rev_app_cons_lemma,
cons_wf,
null_cons_lemma,
valueall-type_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
thin,
lambdaFormation,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
independent_functionElimination,
voidElimination,
sqequalRule,
lambdaEquality,
dependent_functionElimination,
isect_memberEquality,
sqequalAxiom,
because_Cache,
cumulativity,
applyEquality,
unionElimination,
voidEquality,
callbyvalueReduce,
sqleReflexivity,
promote_hyp,
hypothesis_subsumption,
productElimination,
applyLambdaEquality,
imageMemberEquality,
baseClosed,
imageElimination,
addEquality,
dependent_set_memberEquality,
independent_pairFormation,
minusEquality,
equalityTransitivity,
equalitySymmetry,
intEquality,
instantiate,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[as,bs:T List]. (ml-revappend(as;bs) \msim{} rev(as) + bs) supposing valueall-type(T)
Date html generated:
2017_09_29-PM-05_51_08
Last ObjectModification:
2017_05_10-PM-07_11_21
Theory : ML
Home
Index