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

Theorem ltaprg 7679
Description: Ordering property of addition. Proposition 9-3.5(v) of [Gleason] p. 123. (Contributed by Jim Kingdon, 26-Dec-2019.)
Assertion
Ref Expression
ltaprg  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  <P  B  <->  ( C  +P.  A )  <P  ( C  +P.  B ) ) )

Proof of Theorem ltaprg
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ltaprlem 7678 . . 3  |-  ( C  e.  P.  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )
213ad2ant3 1022 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )
3 ltexpri 7673 . . . . 5  |-  ( ( C  +P.  A ) 
<P  ( C  +P.  B
)  ->  E. x  e.  P.  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) )
43adantl 277 . . . 4  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( C  +P.  A
)  <P  ( C  +P.  B ) )  ->  E. x  e.  P.  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) )
5 simpl1 1002 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  A  e.  P. )
6 simprl 529 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  x  e.  P. )
7 ltaddpr 7657 . . . . . . 7  |-  ( ( A  e.  P.  /\  x  e.  P. )  ->  A  <P  ( A  +P.  x ) )
85, 6, 7syl2anc 411 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  A  <P  ( A  +P.  x ) )
9 addassprg 7639 . . . . . . . . . . . 12  |-  ( ( C  e.  P.  /\  A  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
1093com12 1209 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  C  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
11103expa 1205 . . . . . . . . . 10  |-  ( ( ( A  e.  P.  /\  C  e.  P. )  /\  x  e.  P. )  ->  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
1211adantrr 479 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( ( C  +P.  A )  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
13 simprr 531 . . . . . . . . 9  |-  ( ( ( A  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) )
1412, 13eqtr3d 2228 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B ) )
15143adantl2 1156 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B ) )
16 simpl3 1004 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  C  e.  P. )
17 addclpr 7597 . . . . . . . . 9  |-  ( ( A  e.  P.  /\  x  e.  P. )  ->  ( A  +P.  x
)  e.  P. )
185, 6, 17syl2anc 411 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( A  +P.  x
)  e.  P. )
19 simpl2 1003 . . . . . . . 8  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  B  e.  P. )
20 addcanprg 7676 . . . . . . . 8  |-  ( ( C  e.  P.  /\  ( A  +P.  x )  e.  P.  /\  B  e.  P. )  ->  (
( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B )  ->  ( A  +P.  x )  =  B ) )
2116, 18, 19, 20syl3anc 1249 . . . . . . 7  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( ( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B )  -> 
( A  +P.  x
)  =  B ) )
2215, 21mpd 13 . . . . . 6  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  -> 
( A  +P.  x
)  =  B )
238, 22breqtrd 4055 . . . . 5  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  A  <P  B )
2423adantlr 477 . . . 4  |-  ( ( ( ( A  e. 
P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( C  +P.  A )  <P  ( C  +P.  B ) )  /\  ( x  e.  P.  /\  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) ) )  ->  A  <P  B )
254, 24rexlimddv 2616 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  /\  ( C  +P.  A
)  <P  ( C  +P.  B ) )  ->  A  <P  B )
2625ex 115 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  (
( C  +P.  A
)  <P  ( C  +P.  B )  ->  A  <P  B ) )
272, 26impbid 129 1  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  <P  B  <->  ( C  +P.  A )  <P  ( C  +P.  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2164   E.wrex 2473   class class class wbr 4029  (class class class)co 5918   P.cnp 7351    +P. cpp 7353    <P cltp 7355
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-eprel 4320  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-irdg 6423  df-1o 6469  df-2o 6470  df-oadd 6473  df-omul 6474  df-er 6587  df-ec 6589  df-qs 6593  df-ni 7364  df-pli 7365  df-mi 7366  df-lti 7367  df-plpq 7404  df-mpq 7405  df-enq 7407  df-nqqs 7408  df-plqqs 7409  df-mqqs 7410  df-1nqqs 7411  df-rq 7412  df-ltnqqs 7413  df-enq0 7484  df-nq0 7485  df-0nq0 7486  df-plq0 7487  df-mq0 7488  df-inp 7526  df-iplp 7528  df-iltp 7530
This theorem is referenced by:  prplnqu  7680  addextpr  7681  caucvgprlemcanl  7704  caucvgprprlemnkltj  7749  caucvgprprlemnbj  7753  caucvgprprlemmu  7755  caucvgprprlemloc  7763  caucvgprprlemexbt  7766  caucvgprprlemexb  7767  caucvgprprlemaddq  7768  caucvgprprlem1  7769  caucvgprprlem2  7770  ltsrprg  7807  gt0srpr  7808  lttrsr  7822  ltsosr  7824  ltasrg  7830  prsrlt  7847  ltpsrprg  7863  map2psrprg  7865
  Copyright terms: Public domain W3C validator