Nuprl Lemma : combine-skips_wf
∀[bs,as:colist(ℕ)]. ∀[k:ℕ]. (combine-skips(as;bs;k) ∈ colist(ℕ))
Proof
Definitions occuring in Statement :
combine-skips: combine-skips(as;bs;n),
colist: colist(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
colist: colist(T),
corec: corec(T.F[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],
all: ∀x:A. B[x],
top: Top,
and: P ∧ Q,
prop: ℙ,
lt_int: i <z j,
subtract: n - m,
ifthenelse: if b then t else f fi ,
btrue: tt,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
bfalse: ff,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
rev_implies: P ⇐ Q,
iff: P ⇐⇒ Q,
ext-eq: A ≡ B,
subtype_rel: A ⊆r B,
nil: [],
cons: [a / b],
b-union: A ⋃ B,
tunion: ⋃x:A.B[x],
combine-skips: combine-skips(as;bs;n),
decidable: Dec(P),
pi2: snd(t)
Lemmas referenced :
nat_properties,
full-omega-unsat,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
istype-int,
int_formula_prop_and_lemma,
istype-void,
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,
primrec-unroll,
istype-nat,
colist_wf,
nat_wf,
subtract-1-ge-0,
lt_int_wf,
eqtt_to_assert,
assert_of_lt_int,
eqff_to_assert,
bool_cases_sqequal,
subtype_base_sq,
bool_wf,
bool_subtype_base,
assert-bnot,
iff_weakening_uiff,
assert_wf,
less_than_wf,
colist-ext,
isaxiom_wf_listunion,
subtype_rel_b-union-left,
unit_wf2,
axiom-listunion,
subtype_rel_b-union-right,
non-axiom-listunion,
btrue_wf,
null_nil_lemma,
reduce_tl_nil_lemma,
it_wf,
ifthenelse_wf,
primrec_wf,
subtract_wf,
decidable__le,
intformnot_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
istype-le,
top_wf,
b-union_wf,
istype-universe,
int_seg_wf,
null_cons_lemma,
reduce_hd_cons_lemma,
reduce_tl_cons_lemma,
bfalse_wf,
itermAdd_wf,
int_term_value_add_lemma,
intformeq_wf,
int_formula_prop_eq_lemma,
int_subtype_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
Error :isect_memberEquality_alt,
thin,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
sqequalRule,
intWeakElimination,
Error :lambdaFormation_alt,
natural_numberEquality,
independent_isectElimination,
approximateComputation,
independent_functionElimination,
Error :dependent_pairFormation_alt,
Error :lambdaEquality_alt,
int_eqEquality,
dependent_functionElimination,
voidElimination,
independent_pairFormation,
Error :universeIsType,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
Error :functionIsTypeImplies,
Error :inhabitedIsType,
because_Cache,
unionElimination,
equalityElimination,
productElimination,
Error :equalityIstype,
promote_hyp,
instantiate,
cumulativity,
Error :isectIsTypeImplies,
hypothesis_subsumption,
applyEquality,
productEquality,
imageMemberEquality,
Error :dependent_pairEquality_alt,
universeEquality,
Error :dependent_set_memberEquality_alt,
baseClosed,
independent_pairEquality,
addEquality,
sqequalBase,
int_eqReduceFalseSq
Latex:
\mforall{}[bs,as:colist(\mBbbN{})]. \mforall{}[k:\mBbbN{}]. (combine-skips(as;bs;k) \mmember{} colist(\mBbbN{}))
Date html generated:
2019_06_20-PM-01_21_10
Last ObjectModification:
2018_12_07-PM-03_48_11
Theory : list_1
Home
Index