Theorem lfnauxeq1d ≪ | index | src | ≫

theorem lfnauxeq1d (_G: wff) (_F1 _F2: set) (k n: nat):
  $ _G -> _F1 == _F2 $ >
  $ _G -> lfnaux _F1 k n = lfnaux _F2 k n $;

Step	Hyp	Ref	Expression
1		hyp _h	_G -> _F1 == _F2
2		eqidd	_G -> k = k
3		eqidd	_G -> n = n
4	1, 2, 3	lfnauxeqd	_G -> lfnaux _F1 k n = lfnaux _F2 k n

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)