Nuprl Lemma : C_Array_wf

∀[length:ℕ]. ∀[elems:C_TYPE()].  (C_Array(length;elems) ∈ C_TYPE())


Proof




Definitions occuring in Statement :  C_Array: C_Array(length;elems),  C_TYPE: C_TYPE(),  nat: ℕ,  uall: ∀[x:A]. B[x],  member: t ∈ T
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  C_TYPE: C_TYPE(),  C_Array: C_Array(length;elems),  eq_atom: x =a y,  ifthenelse: if b then t else f fi ,  bfalse: ff,  btrue: tt,  all: ∀x:A. B[x],  implies: P ⇒ Q,  bool: 𝔹,  unit: Unit,  it: ⋅,  uiff: uiff(P;Q),  and: P ∧ Q,  uimplies: b supposing a,  exists: ∃x:A. B[x],  prop: ℙ,  or: P ∨ Q,  sq_type: SQType(T),  guard: {T},  bnot: ¬bb,  assert: ↑b,  false: False,  subtype_rel: A ⊆r B,  ext-eq: A ≡ B,  C_TYPEco_size: C_TYPEco_size(p),  pi2: snd(t),  C_TYPE_size: C_TYPE_size(p),  nat: ℕ,  le: A ≤ B,  less_than': less_than'(a;b),  not: ¬A,  so_lambda: λ2x.t[x],  so_apply: x[s]
Lemmas referenced :  C_TYPEco-ext,  C_TYPEco_wf,  eq_atom_wf,  bool_wf,  eqtt_to_assert,  assert_of_eq_atom,  unit_wf2,  eqff_to_assert,  equal_wf,  bool_cases_sqequal,  subtype_base_sq,  bool_subtype_base,  assert-bnot,  neg_assert_of_eq_atom,  list_wf,  nat_wf,  add_nat_wf,  false_wf,  le_wf,  C_TYPE_size_wf,  value-type-has-value,  set-value-type,  int-value-type,  has-value_wf-partial,  C_TYPEco_size_wf,  C_TYPE_wf
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  cut,  dependent_set_memberEquality,  lemma_by_obid,  hypothesis,  sqequalRule,  dependent_pairEquality,  tokenEquality,  hypothesisEquality,  sqequalHypSubstitution,  setElimination,  thin,  rename,  isectElimination,  lambdaFormation,  unionElimination,  equalityElimination,  productElimination,  independent_isectElimination,  because_Cache,  equalityTransitivity,  equalitySymmetry,  dependent_pairFormation,  promote_hyp,  dependent_functionElimination,  instantiate,  cumulativity,  independent_functionElimination,  voidElimination,  productEquality,  atomEquality,  voidEquality,  equalityEquality,  applyEquality,  natural_numberEquality,  independent_pairFormation,  intEquality,  lambdaEquality

Latex:
\mforall{}[length:\mBbbN{}].  \mforall{}[elems:C\_TYPE()].    (C\_Array(length;elems)  \mmember{}  C\_TYPE())



Date html generated: 2016_05_16-AM-08_44_42
Last ObjectModification: 2015_12_28-PM-06_58_20

Theory : C-semantics


Home Index