Theorem qbtwnrelemcalc 10690

Description: Lemma for qbtwnre 10691. Calculations involved in showing the constructed rational number is less than B. (Contributed by Jim Kingdon, 14-Oct-2021.)

Hypotheses

Ref	Expression
qbtwnrelemcalc.m	|- ( ph -> M e. ZZ )
qbtwnrelemcalc.n	|- ( ph -> N e. NN )
qbtwnrelemcalc.a	|- ( ph -> A e. RR )
qbtwnrelemcalc.b	|- ( ph -> B e. RR )
qbtwnrelemcalc.lt	|- ( ph -> M < ( A x. ( 2 x. N ) ) )
qbtwnrelemcalc.1n	|- ( ph -> ( 1 / N ) < ( B - A ) )

Assertion

Ref	Expression
qbtwnrelemcalc	|- ( ph -> ( ( M + 2 ) / ( 2 x. N ) ) < B )

Proof of Theorem qbtwnrelemcalc

Step	Hyp	Ref	Expression
1		2re 9374	. . . . 5 |- 2 e. RR
2	1	a1i 9	. . . 4 |- ( ph -> 2 e. RR )
3		qbtwnrelemcalc.b	. . . . . 6 |- ( ph -> B e. RR )
4		qbtwnrelemcalc.n	. . . . . . . 8 |- ( ph -> N e. NN )
5	4	nnred 9317	. . . . . . 7 |- ( ph -> N e. RR )
6	2, 5	remulcld 8356	. . . . . 6 |- ( ph -> ( 2 x. N ) e. RR )
7	3, 6	remulcld 8356	. . . . 5 |- ( ph -> ( B x. ( 2 x. N ) ) e. RR )
8		qbtwnrelemcalc.a	. . . . . 6 |- ( ph -> A e. RR )
9	8, 6	remulcld 8356	. . . . 5 |- ( ph -> ( A x. ( 2 x. N ) ) e. RR )
10	7, 9	resubcld 8708	. . . 4 |- ( ph -> ( ( B x. ( 2 x. N ) ) - ( A x. ( 2 x. N ) ) ) e. RR )
11		qbtwnrelemcalc.m	. . . . . 6 |- ( ph -> M e. ZZ )
12	11	zred 9768	. . . . 5 |- ( ph -> M e. RR )
13	7, 12	resubcld 8708	. . . 4 |- ( ph -> ( ( B x. ( 2 x. N ) ) - M ) e. RR )
14		2t1e2 9458	. . . . . . . . 9 |- ( 2 x. 1 ) = 2
15	14	oveq1i 6095	. . . . . . . 8 |- ( ( 2 x. 1 ) / ( 2 x. N ) ) = ( 2 / ( 2 x. N ) )
16		1cnd 8342	. . . . . . . . 9 |- ( ph -> 1 e. CC )
17	5	recnd 8354	. . . . . . . . 9 |- ( ph -> N e. CC )
18	2	recnd 8354	. . . . . . . . 9 |- ( ph -> 2 e. CC )
19	4	nnap0d 9350	. . . . . . . . 9 |- ( ph -> N # 0 )
20		2ap0 9397	. . . . . . . . . 10 |- 2 # 0
21	20	a1i 9	. . . . . . . . 9 |- ( ph -> 2 # 0 )
22	16, 17, 18, 19, 21	divcanap5d 9147	. . . . . . . 8 |- ( ph -> ( ( 2 x. 1 ) / ( 2 x. N ) ) = ( 1 / N ) )
23	15, 22	eqtr3id 2285	. . . . . . 7 |- ( ph -> ( 2 / ( 2 x. N ) ) = ( 1 / N ) )
24		qbtwnrelemcalc.1n	. . . . . . 7 |- ( ph -> ( 1 / N ) < ( B - A ) )
25	23, 24	eqbrtrd 4152	. . . . . 6 |- ( ph -> ( 2 / ( 2 x. N ) ) < ( B - A ) )
26	3, 8	resubcld 8708	. . . . . . 7 |- ( ph -> ( B - A ) e. RR )
27		2rp 10059	. . . . . . . . 9 |- 2 e. RR+
28	27	a1i 9	. . . . . . . 8 |- ( ph -> 2 e. RR+ )
29	4	nnrpd 10095	. . . . . . . 8 |- ( ph -> N e. RR+ )
30	28, 29	rpmulcld 10114	. . . . . . 7 |- ( ph -> ( 2 x. N ) e. RR+ )
31	2, 26, 30	ltdivmul2d 10150	. . . . . 6 |- ( ph -> ( ( 2 / ( 2 x. N ) ) < ( B - A ) <-> 2 < ( ( B - A ) x. ( 2 x. N ) ) ) )
32	25, 31	mpbid 147	. . . . 5 |- ( ph -> 2 < ( ( B - A ) x. ( 2 x. N ) ) )
33	3	recnd 8354	. . . . . 6 |- ( ph -> B e. CC )
34	8	recnd 8354	. . . . . 6 |- ( ph -> A e. CC )
35	18, 17	mulcld 8346	. . . . . 6 |- ( ph -> ( 2 x. N ) e. CC )
36	33, 34, 35	subdird 8742	. . . . 5 |- ( ph -> ( ( B - A ) x. ( 2 x. N ) ) = ( ( B x. ( 2 x. N ) ) - ( A x. ( 2 x. N ) ) ) )
37	32, 36	breqtrd 4156	. . . 4 |- ( ph -> 2 < ( ( B x. ( 2 x. N ) ) - ( A x. ( 2 x. N ) ) ) )
38		qbtwnrelemcalc.lt	. . . . 5 |- ( ph -> M < ( A x. ( 2 x. N ) ) )
39	12, 9, 7, 38	ltsub2dd 8886	. . . 4 |- ( ph -> ( ( B x. ( 2 x. N ) ) - ( A x. ( 2 x. N ) ) ) < ( ( B x. ( 2 x. N ) ) - M ) )
40	2, 10, 13, 37, 39	lttrd 8452	. . 3 |- ( ph -> 2 < ( ( B x. ( 2 x. N ) ) - M ) )
41	12, 2, 7	ltaddsub2d 8874	. . 3 |- ( ph -> ( ( M + 2 ) < ( B x. ( 2 x. N ) ) <-> 2 < ( ( B x. ( 2 x. N ) ) - M ) ) )
42	40, 41	mpbird 167	. 2 |- ( ph -> ( M + 2 ) < ( B x. ( 2 x. N ) ) )
43	12, 2	readdcld 8355	. . 3 |- ( ph -> ( M + 2 ) e. RR )
44	43, 3, 30	ltdivmul2d 10150	. 2 |- ( ph -> ( ( ( M + 2 ) / ( 2 x. N ) ) < B <-> ( M + 2 ) < ( B x. ( 2 x. N ) ) ) )
45	42, 44	mpbird 167	1 |- ( ph -> ( ( M + 2 ) / ( 2 x. N ) ) < B )

This proof depends on syntax axioms:   -> wi 4   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8178   0cc0 8179   1c1 8180   + caddc 8182   x. cmul 8184   < clt 8360   - cmin 8497   # cap 8909   / cdiv 9002   NNcn 9304   2c2 9355   ZZcz 9644   RR+crp 10054

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-z 9645  df-rp 10055

This theorem is used by:  qbtwnre  10691