Theorem lfnauxeq1 | index | src |

theorem lfnauxeq1 (_F1 _F2: set) (k n: nat):
  $ _F1 == _F2 -> lfnaux _F1 k n = lfnaux _F2 k n $;
StepHypRefExpression
1 id
_F1 == _F2 -> _F1 == _F2
2 1 lfnauxeq1d
_F1 == _F2 -> 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)