Nuprl Lemma : qavg-eq-iff-8

[a,b,c:ℚ].  uiff(qavg(b;a) qavg(c;a) ∈ ℚ;b c ∈ ℚ)


Proof




Definitions occuring in Statement :  qavg: qavg(a;b) rationals: uiff: uiff(P;Q) uall: [x:A]. B[x] equal: t ∈ T
Definitions unfolded in proof :  iff: ⇐⇒ Q guard: {T} prop: true: True squash: T false: False assert: b bfalse: ff eq_int: (i =z j) btrue: tt ifthenelse: if then else fi  evalall: evalall(t) callbyvalueall: callbyvalueall qeq: qeq(r;s) implies:  Q not: ¬A subtype_rel: A ⊆B uimplies: supposing a and: P ∧ Q uiff: uiff(P;Q) member: t ∈ T uall: [x:A]. B[x] qavg: qavg(a;b)
Lemmas referenced :  qadd_inv_assoc_q qadd_ac_1_q iff_weakening_equal qmul-qdiv-cancel subtype_rel_self qadd_comm_q equal-wf-T-base not_wf istype-universe true_wf squash_wf equal_wf int-subtype-rationals rationals_wf qmul_wf assert-qeq qadd_wf qdiv_wf
Rules used in proof :  independent_functionElimination universeEquality instantiate universeIsType minusEquality isectIsTypeImplies axiomEquality isect_memberEquality_alt independent_pairEquality imageMemberEquality imageElimination lambdaEquality_alt rename setElimination applyLambdaEquality productIsType dependent_set_memberEquality_alt sqequalBase baseClosed voidElimination productElimination equalitySymmetry equalityTransitivity lambdaFormation_alt independent_isectElimination because_Cache applyEquality natural_numberEquality thin isectElimination sqequalHypSubstitution extract_by_obid hypothesisEquality inhabitedIsType equalityIstype hypothesis independent_pairFormation cut introduction isect_memberFormation_alt computationStep sqequalTransitivity sqequalReflexivity sqequalRule sqequalSubstitution

Latex:
\mforall{}[a,b,c:\mBbbQ{}].    uiff(qavg(b;a)  =  qavg(c;a);b  =  c)



Date html generated: 2019_10_29-AM-07_45_12
Last ObjectModification: 2019_10_22-AM-00_12_25

Theory : rationals


Home Index