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

Theorem addextpr 7884
Description: Strong extensionality of addition (ordering version). This is similar to addext 8832 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 7800 . . . 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 7800 . . . 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 531 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  C  e.  P. )
6 simplr 529 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  B  e.  P. )
7 addclpr 7800 . . . 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 7859 . . . 4  |-  <P  Or  P.
10 sowlin 4423 . . . 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 1274 . 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 7882 . . . . 5  |-  ( ( A  e.  P.  /\  C  e.  P.  /\  B  e.  P. )  ->  ( A  <P  C  <->  ( B  +P.  A )  <P  ( B  +P.  C ) ) )
1513, 5, 6, 14syl3anc 1274 . . . 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 7841 . . . . . . 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 6189 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( A  +P.  B )  =  ( B  +P.  A ) )
1917, 5, 6caovcomd 6189 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( C  +P.  B )  =  ( B  +P.  C ) )
2018, 19breq12d 4106 . . . 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 533 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  D  e.  P. )
23 ltaprg 7882 . . . 4  |-  ( ( B  e.  P.  /\  D  e.  P.  /\  C  e.  P. )  ->  ( B  <P  D  <->  ( C  +P.  B )  <P  ( C  +P.  D ) ) )
246, 22, 5, 23syl3anc 1274 . . 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 801 . 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 716    /\ w3a 1005    = wceq 1398    e. wcel 2202   class class class wbr 4093    Or wor 4398  (class class class)co 6028   P.cnp 7554    +P. cpp 7556    <P cltp 7558
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-enq0 7687  df-nq0 7688  df-0nq0 7689  df-plq0 7690  df-mq0 7691  df-inp 7729  df-iplp 7731  df-iltp 7733
This theorem is referenced by:  mulextsr1lem  8043
  Copyright terms: Public domain W3C validator