Theorem addextpr 7988

Description: Strong extensionality of addition (ordering version). This is similar to addext 8938 but for positive reals and based on less-than rather than apartness. (Contributed by Jim Kingdon, 17-Feb-2020.)

Assertion

Ref	Expression
addextpr	|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( ( A +P. B ) <P ( C +P. D ) -> ( A <P C \/ B <P D ) ) )

Proof of Theorem addextpr

Dummy variables f g are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addclpr 7904	. . . 4 |- ( ( A e. P. /\ B e. P. ) -> ( A +P. B ) e. P. )
2	1	adantr 276	. . 3 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( A +P. B ) e. P. )
3		addclpr 7904	. . . 4 |- ( ( C e. P. /\ D e. P. ) -> ( C +P. D ) e. P. )
4	3	adantl 277	. . 3 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( C +P. D ) e. P. )
5		simprl 535	. . . 4 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> C e. P. )
6		simplr 533	. . . 4 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> B e. P. )
7		addclpr 7904	. . . 4 |- ( ( C e. P. /\ B e. P. ) -> ( C +P. B ) e. P. )
8	5, 6, 7	syl2anc 415	. . 3 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( C +P. B ) e. P. )
9		ltsopr 7963	. . . 4 |- <P Or P.
10		sowlin 4465	. . . 4 |- ( ( <P Or P. /\ ( ( A +P. B ) e. P. /\ ( C +P. D ) e. P. /\ ( C +P. B ) e. P. ) ) -> ( ( A +P. B ) <P ( C +P. D ) -> ( ( A +P. B ) <P ( C +P. B ) \/ ( C +P. B ) <P ( C +P. D ) ) ) )
11	9, 10	mpan 428	. . 3 |- ( ( ( A +P. B ) e. P. /\ ( C +P. D ) e. P. /\ ( C +P. B ) e. P. ) -> ( ( A +P. B ) <P ( C +P. D ) -> ( ( A +P. B ) <P ( C +P. B ) \/ ( C +P. B ) <P ( C +P. D ) ) ) )
12	2, 4, 8, 11	syl3anc 1278	. 2 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( ( A +P. B ) <P ( C +P. D ) -> ( ( A +P. B ) <P ( C +P. B ) \/ ( C +P. B ) <P ( C +P. D ) ) ) )
13		simpll 531	. . . . 5 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> A e. P. )
14		ltaprg 7986	. . . . 5 |- ( ( A e. P. /\ C e. P. /\ B e. P. ) -> ( A <P C <-> ( B +P. A ) <P ( B +P. C ) ) )
15	13, 5, 6, 14	syl3anc 1278	. . . 4 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( A <P C <-> ( B +P. A ) <P ( B +P. C ) ) )
16		addcomprg 7945	. . . . . . 7 |- ( ( f e. P. /\ g e. P. ) -> ( f +P. g ) = ( g +P. f ) )
17	16	adantl 277	. . . . . 6 |- ( ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) /\ ( f e. P. /\ g e. P. ) ) -> ( f +P. g ) = ( g +P. f ) )
18	17, 13, 6	caovcomd 6246	. . . . 5 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( A +P. B ) = ( B +P. A ) )
19	17, 5, 6	caovcomd 6246	. . . . 5 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( C +P. B ) = ( B +P. C ) )
20	18, 19	breq12d 4143	. . . 4 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( ( A +P. B ) <P ( C +P. B ) <-> ( B +P. A ) <P ( B +P. C ) ) )
21	15, 20	bitr4d 191	. . 3 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( A <P C <-> ( A +P. B ) <P ( C +P. B ) ) )
22		simprr 537	. . . 4 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> D e. P. )
23		ltaprg 7986	. . . 4 |- ( ( B e. P. /\ D e. P. /\ C e. P. ) -> ( B <P D <-> ( C +P. B ) <P ( C +P. D ) ) )
24	6, 22, 5, 23	syl3anc 1278	. . 3 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( B <P D <-> ( C +P. B ) <P ( C +P. D ) ) )
25	21, 24	orbi12d 805	. 2 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( ( A <P C \/ B <P D ) <-> ( ( A +P. B ) <P ( C +P. B ) \/ ( C +P. B ) <P ( C +P. D ) ) ) )
26	12, 25	sylibrd 169	1 |- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( ( A +P. B ) <P ( C +P. D ) -> ( A <P C \/ B <P D ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   class class class wbr 4130   Or wor 4440  (class class class)co 6085   P.cnp 7658   +P. cpp 7660   <P cltp 7662

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-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-iplp 7835  df-iltp 7837

This theorem is used by:  mulextsr1lem  8147