Nuprl Lemma : C_DVALUEpco_size_wf
∀[p:C_DVALUEpco()]. (C_DVALUEpco_size(p) ∈ partial(ℕ))
Proof
Definitions occuring in Statement :
C_DVALUEpco_size: C_DVALUEpco_size(p),
C_DVALUEpco: C_DVALUEpco(),
partial: partial(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
continuous-monotone: ContinuousMonotone(T.F[T]),
and: P ∧ Q,
type-monotone: Monotone(T.F[T]),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
strong-type-continuous: Continuous+(T.F[T]),
type-continuous: Continuous(T.F[T]),
C_DVALUEpco: C_DVALUEpco(),
eq_atom: x =a y,
le: A ≤ B,
less_than': less_than'(a;b),
not: ¬A,
pi1: fst(t),
pi2: snd(t),
nequal: a ≠ b ∈ T ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
top: Top,
int_seg: {i..j-},
lelt: i ≤ j < k,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
less_than: a < b,
squash: ↓T,
C_DVALUEpco_size: C_DVALUEpco_size(p)
Lemmas referenced :
C_DVALUEpco_wf,
partial_wf,
length_wf,
decidable__lt,
int_seg_properties,
list-subtype,
select_wf,
length_wf_nat,
int_formula_prop_less_lemma,
intformless_wf,
assert_of_bnot,
iff_weakening_uiff,
not_wf,
bnot_wf,
assert_wf,
iff_transitivity,
lelt_wf,
add-member-int_seg1,
bool_cases,
int_formula_prop_wf,
int_term_value_var_lemma,
int_term_value_subtract_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermVar_wf,
itermSubtract_wf,
itermConstant_wf,
intformle_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__le,
subtract_wf,
assert_of_le_int,
le_int_wf,
sum-partial-nat,
add-wf-partial-nat,
inclusion-partial,
false_wf,
atom_subtype_base,
subtype_rel_weakening,
continuous-id,
strong-continuous-function,
continuous-constant,
strong-continuous-depproduct,
subtype_rel_wf,
set_wf,
subtype_rel_dep_function,
neg_assert_of_eq_atom,
assert-bnot,
bool_subtype_base,
subtype_base_sq,
bool_cases_sqequal,
equal_wf,
eqff_to_assert,
subtype_rel_self,
assert_of_eq_atom,
eqtt_to_assert,
bool_wf,
subtype_rel_product,
l_member_wf,
list_wf,
int_seg_wf,
C_LVALUE_wf,
unit_wf2,
eq_atom_wf,
ifthenelse_wf,
nat-mono,
int-value-type,
le_wf,
set-value-type,
nat_wf,
fix_wf_corec-partial1
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
independent_isectElimination,
sqequalRule,
intEquality,
lambdaEquality,
natural_numberEquality,
hypothesisEquality,
productEquality,
atomEquality,
instantiate,
tokenEquality,
universeEquality,
unionEquality,
functionEquality,
setEquality,
voidEquality,
independent_pairFormation,
introduction,
because_Cache,
lambdaFormation,
unionElimination,
equalityElimination,
productElimination,
dependent_pairFormation,
equalityTransitivity,
equalitySymmetry,
promote_hyp,
dependent_functionElimination,
independent_functionElimination,
voidElimination,
equalityEquality,
axiomEquality,
isect_memberEquality,
cumulativity,
isectEquality,
applyEquality,
dependent_set_memberEquality,
int_eqEquality,
computeAll,
setElimination,
rename,
impliesFunctionality,
imageElimination
Latex:
\mforall{}[p:C\_DVALUEpco()]. (C\_DVALUEpco\_size(p) \mmember{} partial(\mBbbN{}))
Date html generated:
2016_05_16-AM-08_48_51
Last ObjectModification:
2016_01_17-AM-09_44_12
Theory : C-semantics
Home
Index