Nuprl Lemma : same-binding-refl
∀[vs:varname() List]. ∀[v:varname()]. (same-binding(vs;vs;v;v) ~ tt)
Proof
Definitions occuring in Statement :
same-binding: same-binding(vs;ws;v;w),
varname: varname(),
list: T List,
btrue: tt,
uall: ∀[x:A]. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
not: ¬A,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
and: P ∧ Q,
prop: ℙ,
or: P ∨ Q,
same-binding: same-binding(vs;ws;v;w),
nil: [],
it: ⋅,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
true: True,
sq_type: SQType(T),
cons: [a / b],
le: A ≤ B,
less_than': less_than'(a;b),
colength: colength(L),
so_lambda: λ2x.t[x],
so_apply: x[s],
less_than: a < b,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
subtype_rel: A ⊆r B,
bool: 𝔹,
bnot: ¬bb,
band: p ∧b q
Lemmas referenced :
nat_properties,
full-omega-unsat,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
istype-int,
int_formula_prop_and_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
ge_wf,
istype-less_than,
varname_wf,
list-cases,
subtype_base_sq,
bool_wf,
bool_subtype_base,
iff_imp_equal_bool,
eq_var_wf,
iff_functionality_wrt_iff,
assert_wf,
member_wf,
btrue_wf,
true_wf,
iff_weakening_uiff,
assert-eq_var,
iff_weakening_equal,
istype-true,
product_subtype_list,
colength-cons-not-zero,
istype-nat,
colength_wf_list,
istype-void,
istype-le,
list_wf,
subtract-1-ge-0,
intformeq_wf,
int_formula_prop_eq_lemma,
set_subtype_base,
int_subtype_base,
spread_cons_lemma,
decidable__equal_int,
subtract_wf,
intformnot_wf,
itermSubtract_wf,
itermAdd_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
int_term_value_add_lemma,
decidable__le,
le_wf,
istype-assert
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
thin,
lambdaFormation_alt,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
approximateComputation,
independent_functionElimination,
dependent_pairFormation_alt,
lambdaEquality_alt,
int_eqEquality,
dependent_functionElimination,
Error :memTop,
sqequalRule,
independent_pairFormation,
universeIsType,
voidElimination,
isect_memberEquality_alt,
axiomSqEquality,
isectIsTypeImplies,
inhabitedIsType,
functionIsTypeImplies,
unionElimination,
instantiate,
cumulativity,
because_Cache,
equalityTransitivity,
equalitySymmetry,
productElimination,
equalityIstype,
promote_hyp,
hypothesis_subsumption,
dependent_set_memberEquality_alt,
applyLambdaEquality,
imageElimination,
baseApply,
closedConclusion,
baseClosed,
applyEquality,
intEquality,
sqequalBase
Latex:
\mforall{}[vs:varname() List]. \mforall{}[v:varname()]. (same-binding(vs;vs;v;v) \msim{} tt)
Date html generated:
2020_05_19-PM-09_53_07
Last ObjectModification:
2020_03_09-PM-04_08_00
Theory : terms
Home
Index