Nuprl Lemma : no_repeats-single
∀[T:Type]. ∀[x:T]. no_repeats(T;[x])
Proof
Definitions occuring in Statement :
no_repeats: no_repeats(T;l),
cons: [a / b],
nil: [],
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
implies: P ⇒ Q
Lemmas referenced :
no_repeats_singleton,
no_repeats_witness,
cons_wf,
nil_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
independent_functionElimination,
sqequalRule,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[x:T]. no\_repeats(T;[x])
Date html generated:
2016_05_14-PM-01_27_46
Last ObjectModification:
2015_12_26-PM-05_21_19
Theory : list_1
Home
Index