Nuprl Lemma : reject_cons_hd_sq
∀[T:Type]. ∀[a:T]. ∀[as:T List]. ∀[i:ℤ]. [a / as]\[i] ~ as supposing i ≤ 0
Proof
Definitions occuring in Statement :
reject: as\[i],
cons: [a / b],
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
le: A ≤ B,
natural_number: $n,
int: ℤ,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
reject: as\[i],
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
top: Top,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3]
Lemmas referenced :
le_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_le_int,
reduce_tl_cons_lemma,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
list_ind_cons_lemma,
le_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
natural_numberEquality,
hypothesis,
lambdaFormation,
unionElimination,
equalityElimination,
equalityTransitivity,
equalitySymmetry,
productElimination,
independent_isectElimination,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
dependent_pairFormation,
promote_hyp,
instantiate,
cumulativity,
independent_functionElimination,
because_Cache,
sqequalAxiom,
intEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[a:T]. \mforall{}[as:T List]. \mforall{}[i:\mBbbZ{}]. [a / as]\mbackslash{}[i] \msim{} as supposing i \mleq{} 0
Date html generated:
2017_04_17-AM-08_48_24
Last ObjectModification:
2017_02_27-PM-05_06_11
Theory : list_1
Home
Index