Theorem sneqd ≪ | index | src | ≫

theorem sneqd (_G: wff) (_a1 _a2: nat):
  $ _G -> _a1 = _a2 $ >
  $ _G -> sn _a1 = sn _a2 $;

Step	Hyp	Ref	Expression
1		eqidd	_G -> 2 = 2
2		hyp _ah	_G -> _a1 = _a2
3	1, 2	poweqd	_G -> 2 ^ _a1 = 2 ^ _a2
4	3	conv sn	_G -> sn _a1 = sn _a2

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)