Nuprl Lemma : interleaving_wf

∀[T:Type]. ∀[L1,L2,L:T List].  (interleaving(T;L1;L2;L) ∈ ℙ)


Proof




Definitions occuring in Statement :  interleaving: interleaving(T;L1;L2;L),  list: T List,  uall: ∀[x:A]. B[x],  prop: ℙ,  member: t ∈ T,  universe: Type
Definitions unfolded in proof :  interleaving: interleaving(T;L1;L2;L),  uall: ∀[x:A]. B[x],  member: t ∈ T,  prop: ℙ,  and: P ∧ Q,  nat: ℕ,  all: ∀x:A. B[x],  implies: P ⇒ Q,  guard: {T},  ge: i ≥ j ,  decidable: Dec(P),  or: P ∨ Q,  false: False,  uiff: uiff(P;Q),  uimplies: b supposing a,  satisfiable_int_formula: satisfiable_int_formula(fmla),  exists: ∃x:A. B[x],  not: ¬A,  top: Top
Lemmas referenced :  equal_wf,  nat_wf,  length_wf_nat,  length_wf,  add_nat_wf,  nat_properties,  decidable__le,  add-is-int-iff,  satisfiable-full-omega-tt,  intformand_wf,  intformnot_wf,  intformle_wf,  itermConstant_wf,  itermVar_wf,  itermAdd_wf,  intformeq_wf,  int_formula_prop_and_lemma,  int_formula_prop_not_lemma,  int_formula_prop_le_lemma,  int_term_value_constant_lemma,  int_term_value_var_lemma,  int_term_value_add_lemma,  int_formula_prop_eq_lemma,  int_formula_prop_wf,  false_wf,  le_wf,  disjoint_sublists_wf,  list_wf
Rules used in proof :  sqequalSubstitution,  sqequalRule,  sqequalReflexivity,  sqequalTransitivity,  computationStep,  isect_memberFormation,  introduction,  cut,  productEquality,  extract_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  hypothesis,  cumulativity,  hypothesisEquality,  dependent_set_memberEquality,  addEquality,  lambdaFormation,  equalityTransitivity,  equalitySymmetry,  applyLambdaEquality,  setElimination,  rename,  dependent_functionElimination,  natural_numberEquality,  unionElimination,  pointwiseFunctionality,  promote_hyp,  baseApply,  closedConclusion,  baseClosed,  productElimination,  independent_isectElimination,  dependent_pairFormation,  lambdaEquality,  int_eqEquality,  intEquality,  isect_memberEquality,  voidElimination,  voidEquality,  independent_pairFormation,  computeAll,  independent_functionElimination,  because_Cache,  axiomEquality,  universeEquality

Latex:
\mforall{}[T:Type].  \mforall{}[L1,L2,L:T  List].    (interleaving(T;L1;L2;L)  \mmember{}  \mBbbP{})



Date html generated: 2017_10_01-AM-08_35_48
Last ObjectModification: 2017_07_26-PM-04_25_57

Theory : list!


Home Index