Theorem eqmcomb ≪ | index | src | ≫

theorem eqmcomb (a b n: nat): $ mod(n): a = b <-> mod(n): b = a $;

Step	Hyp	Ref	Expression
1		eqmcom	mod(n): a = b -> mod(n): b = a
2		eqmcom	mod(n): b = a -> mod(n): a = b
3	1, 2	ibii	mod(n): a = b <-> mod(n): b = a

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)