Theorem sepeq1d ≪ | index | src | ≫

theorem sepeq1d (_G: wff) (_n1 _n2: nat) (A: set):
  $ _G -> _n1 = _n2 $ >
  $ _G -> sep _n1 A = sep _n2 A $;

Step	Hyp	Ref	Expression
1		hyp _h	_G -> _n1 = _n2
2		eqsidd	_G -> A == A
3	1, 2	sepeqd	_G -> sep _n1 A = sep _n2 A

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)