Nuprl Lemma : remove-repeats-set-equal
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[L1,L2:T List].
||remove-repeats(eq;L1)|| = ||remove-repeats(eq;L2)|| ∈ ℤ supposing set-equal(T;L1;L2)
Proof
Definitions occuring in Statement :
remove-repeats: remove-repeats(eq;L),
set-equal: set-equal(T;x;y),
length: ||as||,
list: T List,
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
int: ℤ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
and: P ∧ Q,
set-equal: set-equal(T;x;y),
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
rev_implies: P ⇐ Q,
prop: ℙ
Lemmas referenced :
set-equal-no_repeats-length,
remove-repeats_wf,
remove-repeats_property,
member-remove-repeats,
l_member_wf,
iff_wf,
set-equal_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
independent_isectElimination,
because_Cache,
dependent_functionElimination,
productElimination,
lambdaFormation,
addLevel,
independent_pairFormation,
impliesFunctionality,
independent_functionElimination,
sqequalRule,
isect_memberEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. \mforall{}[L1,L2:T List].
||remove-repeats(eq;L1)|| = ||remove-repeats(eq;L2)|| supposing set-equal(T;L1;L2)
Date html generated:
2016_05_14-PM-03_26_08
Last ObjectModification:
2015_12_26-PM-06_22_52
Theory : decidable!equality
Home
Index