Theorem leprid1 ≪ | index | src | ≫

theorem leprid1 (a b: nat): $ a <= a, b $;

Step	Hyp	Ref	Expression
1		letr	a <= a + b -> a + b <= a, b -> a <= a, b
2		leaddid1	a <= a + b
3	1, 2	ax_mp	a + b <= a, b -> a <= a, b
4		addlepr	a + b <= a, b
5	3, 4	ax_mp	a <= a, b

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 (peano1, peano2, peano5, addeq, muleq, add0, addS, mul0, mulS)