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

Theorem ltaprlem 7995
Description: Lemma for Proposition 9-3.5(v) of [Gleason] p. 123. (Contributed by NM, 8-Apr-1996.)
Assertion
Ref Expression
ltaprlem  |-  ( C  e.  P.  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )

Proof of Theorem ltaprlem
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ltexpri 7990 . . . 4  |-  ( A 
<P  B  ->  E. x  e.  P.  ( A  +P.  x )  =  B )
21adantr 276 . . 3  |-  ( ( A  <P  B  /\  C  e.  P. )  ->  E. x  e.  P.  ( A  +P.  x )  =  B )
3 simplr 533 . . . . . 6  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  C  e.  P. )
4 ltrelpr 7882 . . . . . . . . . 10  |-  <P  C_  ( P.  X.  P. )
54brel 4829 . . . . . . . . 9  |-  ( A 
<P  B  ->  ( A  e.  P.  /\  B  e.  P. ) )
65simpld 112 . . . . . . . 8  |-  ( A 
<P  B  ->  A  e. 
P. )
76adantr 276 . . . . . . 7  |-  ( ( A  <P  B  /\  C  e.  P. )  ->  A  e.  P. )
87adantr 276 . . . . . 6  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  A  e.  P. )
9 addclpr 7914 . . . . . 6  |-  ( ( C  e.  P.  /\  A  e.  P. )  ->  ( C  +P.  A
)  e.  P. )
103, 8, 9syl2anc 415 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  A )  e.  P. )
11 simprl 535 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  x  e.  P. )
12 ltaddpr 7974 . . . . 5  |-  ( ( ( C  +P.  A
)  e.  P.  /\  x  e.  P. )  ->  ( C  +P.  A
)  <P  ( ( C  +P.  A )  +P.  x ) )
1310, 11, 12syl2anc 415 . . . 4  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  A )  <P  (
( C  +P.  A
)  +P.  x )
)
14 addassprg 7956 . . . . . 6  |-  ( ( C  e.  P.  /\  A  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
153, 8, 11, 14syl3anc 1278 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
16 oveq2 6099 . . . . . 6  |-  ( ( A  +P.  x )  =  B  ->  ( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B
) )
1716ad2antll 495 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  ( A  +P.  x
) )  =  ( C  +P.  B ) )
1815, 17eqtrd 2271 . . . 4  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) )
1913, 18breqtrd 4157 . . 3  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  A )  <P  ( C  +P.  B ) )
202, 19rexlimddv 2673 . 2  |-  ( ( A  <P  B  /\  C  e.  P. )  ->  ( C  +P.  A
)  <P  ( C  +P.  B ) )
2120expcom 116 1  |-  ( C  e.  P.  ->  ( A  <P  B  ->  ( C  +P.  A )  <P 
( C  +P.  B
) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4131  (class class class)co 6091   P.cnp 7668    +P. cpp 7670    <P cltp 7672
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5343  df-fun 5385  df-fn 5386  df-f 5387  df-f1 5388  df-fo 5389  df-f1o 5390  df-fv 5391  df-ov 6094  df-oprab 6095  df-mpo 6096  df-1st 6381  df-2nd 6382  df-recs 6584  df-irdg 6649  df-1o 6695  df-2o 6696  df-oadd 6699  df-omul 6700  df-er 6815  df-ec 6817  df-qs 6821  df-ni 7681  df-pli 7682  df-mi 7683  df-lti 7684  df-plpq 7721  df-mpq 7722  df-enq 7724  df-nqqs 7725  df-plqqs 7726  df-mqqs 7727  df-1nqqs 7728  df-rq 7729  df-ltnqqs 7730  df-enq0 7801  df-nq0 7802  df-0nq0 7803  df-plq0 7804  df-mq0 7805  df-inp 7843  df-iplp 7845  df-iltp 7847
This theorem is used by:  ltaprg  7996
  Copyright terms: Public domain W3C validator