Theorem recnauxeqd ≪ | index | src | ≫

theorem recnauxeqd (_G: wff) (_z1 _z2: nat) (_S1 _S2: set) (_n1 _n2: nat):
  $ _G -> _z1 = _z2 $ >
  $ _G -> _S1 == _S2 $ >
  $ _G -> _n1 = _n2 $ >
  $ _G -> recnaux _z1 _S1 _n1 = recnaux _z2 _S2 _n2 $;


_G -> _z1 = _z2
_G -> 0, _z1 = 0, _z2
_G -> _S1 == _S2
_G -> _S1 @ p = _S2 @ p
_G -> suc (fst p), _S1 @ p = suc (fst p), _S2 @ p
_G -> \ p, suc (fst p), _S1 @ p == \ p, suc (fst p), _S2 @ p
_G -> _n1 = _n2
_G -> rec (0, _z1) (\ p, suc (fst p), _S1 @ p) _n1 = rec (0, _z2) (\ p, suc (fst p), _S2 @ p) _n2
_G -> recnaux _z1 _S1 _n1 = recnaux _z2 _S2 _n2

Step	Hyp	Ref	Expression
1		hyp _zh	_G -> _z1 = _z2
2	1	preq2d	_G -> 0, _z1 = 0, _z2
3		hyp _Sh	_G -> _S1 == _S2
4	3	appeq1d	_G -> _S1 @ p = _S2 @ p
5	4	preq2d	_G -> suc (fst p), _S1 @ p = suc (fst p), _S2 @ p
6	5	lameqd	_G -> \ p, suc (fst p), _S1 @ p == \ p, suc (fst p), _S2 @ p
7		hyp _nh	_G -> _n1 = _n2
8	2, 6, 7	receqd	_G -> rec (0, _z1) (\ p, suc (fst p), _S1 @ p) _n1 = rec (0, _z2) (\ p, suc (fst p), _S2 @ p) _n2
9	8	conv recnaux	_G -> recnaux _z1 _S1 _n1 = recnaux _z2 _S2 _n2

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)