Nuprl Lemma : alpha-aux_wf
∀[opr:Type]. ∀[a,b:term(opr)]. ∀[vs,ws:varname() List]. (alpha-aux(opr;vs;ws;a;b) ∈ ℙ)
Proof
Definitions occuring in Statement :
alpha-aux: alpha-aux(opr;vs;ws;a;b),
term: term(opr),
varname: varname(),
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
member: t ∈ T,
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: ℙ,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
decidable: Dec(P),
or: P ∨ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
coterm-fun: coterm-fun(opr;T),
varterm: varterm(v),
alpha-aux: alpha-aux(opr;vs;ws;a;b),
mkterm: mkterm(opr;bts),
lsum: Σ(f[x] | x ∈ L),
l_all: (∀x∈L.P[x]),
nil: [],
it: ⋅,
cons: [a / b],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
bound-term: bound-term(opr),
pi2: snd(t),
sq_stable: SqStable(P),
squash: ↓T,
l_member: (x ∈ l),
less_than': less_than'(a;b),
select: L[n],
cand: A c∧ B,
nat_plus: ℕ+,
uiff: uiff(P;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,
int_seg_properties,
int_seg_wf,
subtract-1-ge-0,
decidable__equal_int,
subtract_wf,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
intformnot_wf,
intformeq_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_formula_prop_eq_lemma,
int_term_value_subtract_lemma,
decidable__le,
decidable__lt,
istype-le,
subtype_rel_self,
term-ext,
subtype_rel_weakening,
term_wf,
coterm-fun_wf,
ext-eq_inversion,
term_size_var_lemma,
assert_wf,
same-binding_wf,
list_wf,
varname_wf,
false_wf,
term_size_mkterm_lemma,
l_sum_nonneg,
map_wf,
term-size_wf,
pi2_wf,
non_neg_length,
nat_wf,
map_length,
select_wf,
length_wf,
itermAdd_wf,
int_term_value_add_lemma,
list-cases,
equal_wf,
product_subtype_list,
spread_cons_lemma,
rev-append_wf,
mkterm_wf,
lsum_wf,
l_member_wf,
istype-nat,
istype-universe,
summand-le-lsum,
bound-term_wf,
cons_wf,
sq_stable__le,
istype-void,
length_of_cons_lemma,
add_nat_plus,
length_wf_nat,
nat_plus_properties,
add-is-int-iff,
lsum_cons_lemma,
term-size-positive
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
thin,
lambdaFormation_alt,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
sqequalRule,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
approximateComputation,
independent_functionElimination,
dependent_pairFormation_alt,
lambdaEquality_alt,
int_eqEquality,
dependent_functionElimination,
Error :memTop,
independent_pairFormation,
universeIsType,
voidElimination,
isect_memberEquality_alt,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isectIsTypeImplies,
inhabitedIsType,
functionIsTypeImplies,
productElimination,
unionElimination,
applyEquality,
instantiate,
because_Cache,
applyLambdaEquality,
dependent_set_memberEquality_alt,
productIsType,
promote_hyp,
hypothesis_subsumption,
equalityIstype,
productEquality,
intEquality,
addEquality,
setIsType,
universeEquality,
independent_pairEquality,
imageMemberEquality,
baseClosed,
imageElimination,
pointwiseFunctionality,
baseApply,
closedConclusion
Latex:
\mforall{}[opr:Type]. \mforall{}[a,b:term(opr)]. \mforall{}[vs,ws:varname() List]. (alpha-aux(opr;vs;ws;a;b) \mmember{} \mBbbP{})
Date html generated:
2020_05_19-PM-09_55_22
Last ObjectModification:
2020_03_09-PM-04_08_52
Theory : terms
Home
Index