Theorem eqstr4d ≪ | index | src | ≫

theorem eqstr4d (A B C: set) (G: wff):
  $ G -> A == B $ >
  $ G -> C == B $ >
  $ G -> A == C $;

Step	Hyp	Ref	Expression
1		eqstr4	A == B -> C == B -> A == C
2		hyp h1	G -> A == B
3		hyp h2	G -> C == B
4	1, 2, 3	sylc	G -> A == C

Axiom use

axs_prop_calc (ax_1, ax_2, ax_3, ax_mp), axs_pred_calc (ax_gen, ax_4)