Theorem diveqd ≪ | index | src | ≫

theorem diveqd (_G: wff) (_a1 _a2 _b1 _b2: nat):
  $ _G -> _a1 = _a2 $ >
  $ _G -> _b1 = _b2 $ >
  $ _G -> _a1 // _b1 = _a2 // _b2 $;

Step	Hyp	Ref	Expression
1		hyp _bh	_G -> _b1 = _b2
2	1	lteq2d	_G -> (r < _b1 <-> r < _b2)
3	1	muleq1d	_G -> _b1 * q = _b2 * q
4	3	addeq1d	_G -> _b1 * q + r = _b2 * q + r
5		hyp _ah	_G -> _a1 = _a2
6	4, 5	eqeqd	_G -> (_b1 * q + r = _a1 <-> _b2 * q + r = _a2)
7	2, 6	aneqd	_G -> (r < _b1 /\ _b1 * q + r = _a1 <-> r < _b2 /\ _b2 * q + r = _a2)
8	7	exeqd	_G -> (E. r (r < _b1 /\ _b1 * q + r = _a1) <-> E. r (r < _b2 /\ _b2 * q + r = _a2))
9	8	abeqd	_G -> {q \| E. r (r < _b1 /\ _b1 * q + r = _a1)} == {q \| E. r (r < _b2 /\ _b2 * q + r = _a2)}
10	9	theeqd	_G -> the {q \| E. r (r < _b1 /\ _b1 * q + r = _a1)} = the {q \| E. r (r < _b2 /\ _b2 * q + r = _a2)}
11	10	conv div	_G -> _a1 // _b1 = _a2 // _b2

Axiom use

axs_prop_calc (ax_1, ax_2, ax_3, ax_mp, itru), axs_pred_calc (ax_gen, ax_4, ax_5, ax_6, ax_7, ax_10, ax_11, ax_12), axs_set (elab, ax_8), axs_the (theid, the0), axs_peano (peano2, addeq, muleq)