Theorem eqeq1d ≪ | index | src | ≫

theorem eqeq1d (G: wff) (a b c: nat):
  $ G -> a = b $ >
  $ G -> (a = c <-> b = c) $;

Step	Hyp	Ref	Expression
1		eqeq1	a = b -> (a = c <-> b = c)
2		hyp h	G -> a = b
3	1, 2	syl	G -> (a = c <-> b = c)

Axiom use

axs_prop_calc (ax_1, ax_2, ax_3, ax_mp), axs_pred_calc (ax_gen, ax_4, ax_5, ax_6, ax_7)