theorem eqmeqd (_G: wff) (_n1 _n2 _a1 _a2 _b1 _b2: nat):
$ _G -> _n1 = _n2 $ >
$ _G -> _a1 = _a2 $ >
$ _G -> _b1 = _b2 $ >
$ _G -> (mod(_n1): _a1 = _b1 <-> mod(_n2): _a2 = _b2) $;
| Step | Hyp | Ref | Expression |
|---|
| 1 |
|
hyp _ah |
_G -> _a1 = _a2 |
| 2 |
|
hyp _nh |
_G -> _n1 = _n2 |
| 3 |
1, 2 |
modeqd |
_G -> _a1 % _n1 = _a2 % _n2 |
| 4 |
|
hyp _bh |
_G -> _b1 = _b2 |
| 5 |
4, 2 |
modeqd |
_G -> _b1 % _n1 = _b2 % _n2 |
| 6 |
3, 5 |
eqeqd |
_G -> (_a1 % _n1 = _b1 % _n1 <-> _a2 % _n2 = _b2 % _n2) |
| 7 |
6 |
conv eqm |
_G -> (mod(_n1): _a1 = _b1 <-> mod(_n2): _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)