Nuprl Lemma : qdot_wf

[as,bs:ℚ List].  qdot(as;bs) ∈ ℚ supposing dimension(as) dimension(bs) ∈ ℤ


Proof




Definitions occuring in Statement :  qv-dim: dimension(as) qdot: qdot(as;bs) rationals: list: List uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T int: equal: t ∈ T
Definitions unfolded in proof :  qdot: qdot(as;bs) qv-dim: dimension(as) uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a so_lambda: λ2x.t[x] int_seg: {i..j-} guard: {T} lelt: i ≤ j < k and: P ∧ Q all: x:A. B[x] decidable: Dec(P) or: P ∨ Q satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False implies:  Q not: ¬A top: Top prop: so_apply: x[s]
Lemmas referenced :  list_wf length_wf equal_wf int_seg_wf int_formula_prop_eq_lemma intformeq_wf int_formula_prop_less_lemma intformless_wf decidable__lt int_formula_prop_wf int_term_value_var_lemma int_term_value_constant_lemma int_formula_prop_le_lemma int_formula_prop_not_lemma int_formula_prop_and_lemma itermVar_wf itermConstant_wf intformle_wf intformnot_wf intformand_wf satisfiable-full-omega-tt decidable__le int_seg_properties rationals_wf select_wf qmul_wf qsum_wf
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality equalityTransitivity hypothesis equalitySymmetry lambdaEquality hypothesisEquality setElimination rename independent_isectElimination productElimination dependent_functionElimination unionElimination dependent_pairFormation int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation computeAll because_Cache axiomEquality

Latex:
\mforall{}[as,bs:\mBbbQ{}  List].    qdot(as;bs)  \mmember{}  \mBbbQ{}  supposing  dimension(as)  =  dimension(bs)



Date html generated: 2016_05_15-PM-11_20_04
Last ObjectModification: 2016_01_16-PM-09_16_11

Theory : rationals


Home Index