Theorem rlameq1d ≪ | index | src | ≫

theorem rlameq1d (_G: wff) {x: nat} (_a1 _a2 v: nat x):
  $ _G -> _a1 = _a2 $ >
  $ _G -> \. x e. _a1, v = \. x e. _a2, v $;

Step	Hyp	Ref	Expression
1		hyp _h	_G -> _a1 = _a2
2		eqidd	_G -> v = v
3	1, 2	rlameqd	_G -> \. x e. _a1, v = \. x e. _a2, v

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)