Nuprl Lemma : mul_add_distrib

[a,b,c:ℤ].  (((a b) c) ((a c) (b c)) ∈ ℤ)


Proof




Definitions occuring in Statement :  uall: [x:A]. B[x] multiply: m add: m int: equal: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T all: x:A. B[x] decidable: Dec(P) or: P ∨ Q uimplies: supposing a satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False implies:  Q not: ¬A top: Top prop:
Lemmas referenced :  int_formula_prop_wf int_term_value_var_lemma int_term_value_add_lemma int_term_value_mul_lemma int_formula_prop_eq_lemma int_formula_prop_not_lemma itermVar_wf itermAdd_wf itermMultiply_wf intformeq_wf intformnot_wf satisfiable-full-omega-tt decidable__equal_int
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution dependent_functionElimination thin because_Cache hypothesis unionElimination isectElimination natural_numberEquality independent_isectElimination dependent_pairFormation lambdaEquality int_eqEquality hypothesisEquality intEquality isect_memberEquality voidElimination voidEquality sqequalRule computeAll axiomEquality

Latex:
\mforall{}[a,b,c:\mBbbZ{}].    (((a  +  b)  *  c)  =  ((a  *  c)  +  (b  *  c)))



Date html generated: 2016_05_14-PM-04_27_36
Last ObjectModification: 2016_01_14-PM-11_35_12

Theory : num_thy_1


Home Index