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

Theorem ltaprg 7618
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 7617 . . 3  |-  ( C  e.  P.  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )
213ad2ant3 1020 . 2  |-  ( ( A  e.  P.  /\  B  e.  P.  /\  C  e.  P. )  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )
3 ltexpri 7612 . . . . 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 1000 . . . . . . 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 7596 . . . . . . 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 7578 . . . . . . . . . . . 12  |-  ( ( C  e.  P.  /\  A  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
1093com12 1207 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  C  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
11103expa 1203 . . . . . . . . . 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 2212 . . . . . . . 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 1154 . . . . . . 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 1002 . . . . . . . 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 7536 . . . . . . . . 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 1001 . . . . . . . 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 7615 . . . . . . . 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 1238 . . . . . . 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 4030 . . . . 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 2599 . . 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 978    = wceq 1353    e. wcel 2148   E.wrex 2456   class class class wbr 4004  (class class class)co 5875   P.cnp 7290    +P. cpp 7292    <P cltp 7294
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-nul 4130  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-iinf 4588
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-tr 4103  df-eprel 4290  df-id 4294  df-po 4297  df-iso 4298  df-iord 4367  df-on 4369  df-suc 4372  df-iom 4591  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-ov 5878  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-recs 6306  df-irdg 6371  df-1o 6417  df-2o 6418  df-oadd 6421  df-omul 6422  df-er 6535  df-ec 6537  df-qs 6541  df-ni 7303  df-pli 7304  df-mi 7305  df-lti 7306  df-plpq 7343  df-mpq 7344  df-enq 7346  df-nqqs 7347  df-plqqs 7348  df-mqqs 7349  df-1nqqs 7350  df-rq 7351  df-ltnqqs 7352  df-enq0 7423  df-nq0 7424  df-0nq0 7425  df-plq0 7426  df-mq0 7427  df-inp 7465  df-iplp 7467  df-iltp 7469
This theorem is referenced by:  prplnqu  7619  addextpr  7620  caucvgprlemcanl  7643  caucvgprprlemnkltj  7688  caucvgprprlemnbj  7692  caucvgprprlemmu  7694  caucvgprprlemloc  7702  caucvgprprlemexbt  7705  caucvgprprlemexb  7706  caucvgprprlemaddq  7707  caucvgprprlem1  7708  caucvgprprlem2  7709  ltsrprg  7746  gt0srpr  7747  lttrsr  7761  ltsosr  7763  ltasrg  7769  prsrlt  7786  ltpsrprg  7802  map2psrprg  7804
  Copyright terms: Public domain W3C validator