ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  addextpr Unicode version

Theorem addextpr 7831
Description: Strong extensionality of addition (ordering version). This is similar to addext 8780 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.
StepHypRef Expression
1 addclpr 7747 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( A  +P.  B
)  e.  P. )
21adantr 276 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( A  +P.  B )  e.  P. )
3 addclpr 7747 . . . 4  |-  ( ( C  e.  P.  /\  D  e.  P. )  ->  ( C  +P.  D
)  e.  P. )
43adantl 277 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( C  +P.  D )  e.  P. )
5 simprl 529 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  C  e.  P. )
6 simplr 528 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  B  e.  P. )
7 addclpr 7747 . . . 4  |-  ( ( C  e.  P.  /\  B  e.  P. )  ->  ( C  +P.  B
)  e.  P. )
85, 6, 7syl2anc 411 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( C  +P.  B )  e.  P. )
9 ltsopr 7806 . . . 4  |-  <P  Or  P.
10 sowlin 4415 . . . 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
) ) ) )
119, 10mpan 424 . . 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
) ) ) )
122, 4, 8, 11syl3anc 1271 . 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 527 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  A  e.  P. )
14 ltaprg 7829 . . . . 5  |-  ( ( A  e.  P.  /\  C  e.  P.  /\  B  e.  P. )  ->  ( A  <P  C  <->  ( B  +P.  A )  <P  ( B  +P.  C ) ) )
1513, 5, 6, 14syl3anc 1271 . . . 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 7788 . . . . . . 7  |-  ( ( f  e.  P.  /\  g  e.  P. )  ->  ( f  +P.  g
)  =  ( g  +P.  f ) )
1716adantl 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 ) )
1817, 13, 6caovcomd 6174 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( A  +P.  B )  =  ( B  +P.  A ) )
1917, 5, 6caovcomd 6174 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( C  +P.  B )  =  ( B  +P.  C ) )
2018, 19breq12d 4099 . . . 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 ) ) )
2115, 20bitr4d 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 531 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  D  e.  P. )
23 ltaprg 7829 . . . 4  |-  ( ( B  e.  P.  /\  D  e.  P.  /\  C  e.  P. )  ->  ( B  <P  D  <->  ( C  +P.  B )  <P  ( C  +P.  D ) ) )
246, 22, 5, 23syl3anc 1271 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( B  <P  D  <->  ( C  +P.  B )  <P  ( C  +P.  D ) ) )
2521, 24orbi12d 798 . 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
) ) ) )
2612, 25sylibrd 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 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    /\ w3a 1002    = wceq 1395    e. wcel 2200   class class class wbr 4086    Or wor 4390  (class class class)co 6013   P.cnp 7501    +P. cpp 7503    <P cltp 7505
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-eprel 4384  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-1o 6577  df-2o 6578  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7514  df-pli 7515  df-mi 7516  df-lti 7517  df-plpq 7554  df-mpq 7555  df-enq 7557  df-nqqs 7558  df-plqqs 7559  df-mqqs 7560  df-1nqqs 7561  df-rq 7562  df-ltnqqs 7563  df-enq0 7634  df-nq0 7635  df-0nq0 7636  df-plq0 7637  df-mq0 7638  df-inp 7676  df-iplp 7678  df-iltp 7680
This theorem is referenced by:  mulextsr1lem  7990
  Copyright terms: Public domain W3C validator