Nuprl Lemma : palindrome-test_wf
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[L:T List]. (palindrome-test(eq;L) ∈ 𝔹)
Proof
Definitions occuring in Statement :
palindrome-test: palindrome-test(eq;L),
list: T List,
deq: EqDecider(T),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
palindrome-test: palindrome-test(eq;L),
so_lambda: so_lambda(x,y,z.t[x; y; z]),
has-value: (a)↓,
uimplies: b supposing a,
bool: 𝔹,
deq: EqDecider(T),
so_apply: x[s1;s2;s3],
all: ∀x:A. B[x]
Lemmas referenced :
taba_wf,
bool_wf,
btrue_wf,
value-type-has-value,
union-value-type,
unit_wf2,
band_wf,
list_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
hypothesis,
lambdaEquality,
callbyvalueReduce,
independent_isectElimination,
because_Cache,
applyEquality,
setElimination,
rename,
dependent_functionElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. \mforall{}[L:T List]. (palindrome-test(eq;L) \mmember{} \mBbbB{})
Date html generated:
2016_05_15-PM-07_36_45
Last ObjectModification:
2015_12_27-AM-11_16_47
Theory : general
Home
Index