Theorem b1ltid ≪ | index | src | ≫

theorem b1ltid (n: nat): $ n < b1 n $;

Step	Hyp	Ref	Expression
1		leltsuc	n <= b0 n <-> n < suc (b0 n)
2	1	conv b1	n <= b0 n <-> n < b1 n
3		b0leid	n <= b0 n
4	2, 3	mpbi	n < b1 n

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_peano (peano2, peano5, addeq, add0, addS)