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

Theorem ltaprlem 7619
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 7614 . . . 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 528 . . . . . 6  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  C  e.  P. )
4 ltrelpr 7506 . . . . . . . . . 10  |-  <P  C_  ( P.  X.  P. )
54brel 4680 . . . . . . . . 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 7538 . . . . . 6  |-  ( ( C  e.  P.  /\  A  e.  P. )  ->  ( C  +P.  A
)  e.  P. )
103, 8, 9syl2anc 411 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  A )  e.  P. )
11 simprl 529 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  x  e.  P. )
12 ltaddpr 7598 . . . . 5  |-  ( ( ( C  +P.  A
)  e.  P.  /\  x  e.  P. )  ->  ( C  +P.  A
)  <P  ( ( C  +P.  A )  +P.  x ) )
1310, 11, 12syl2anc 411 . . . 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 7580 . . . . . 6  |-  ( ( C  e.  P.  /\  A  e.  P.  /\  x  e.  P. )  ->  (
( C  +P.  A
)  +P.  x )  =  ( C  +P.  ( A  +P.  x ) ) )
153, 8, 11, 14syl3anc 1238 . . . . 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 5885 . . . . . 6  |-  ( ( A  +P.  x )  =  B  ->  ( C  +P.  ( A  +P.  x ) )  =  ( C  +P.  B
) )
1716ad2antll 491 . . . . 5  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  ( A  +P.  x
) )  =  ( C  +P.  B ) )
1815, 17eqtrd 2210 . . . 4  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( ( C  +P.  A )  +P.  x )  =  ( C  +P.  B ) )
1913, 18breqtrd 4031 . . 3  |-  ( ( ( A  <P  B  /\  C  e.  P. )  /\  ( x  e.  P.  /\  ( A  +P.  x
)  =  B ) )  ->  ( C  +P.  A )  <P  ( C  +P.  B ) )
202, 19rexlimddv 2599 . 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
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148   E.wrex 2456   class class class wbr 4005  (class class class)co 5877   P.cnp 7292    +P. cpp 7294    <P cltp 7296
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 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589
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 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-eprel 4291  df-id 4295  df-po 4298  df-iso 4299  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-1o 6419  df-2o 6420  df-oadd 6423  df-omul 6424  df-er 6537  df-ec 6539  df-qs 6543  df-ni 7305  df-pli 7306  df-mi 7307  df-lti 7308  df-plpq 7345  df-mpq 7346  df-enq 7348  df-nqqs 7349  df-plqqs 7350  df-mqqs 7351  df-1nqqs 7352  df-rq 7353  df-ltnqqs 7354  df-enq0 7425  df-nq0 7426  df-0nq0 7427  df-plq0 7428  df-mq0 7429  df-inp 7467  df-iplp 7469  df-iltp 7471
This theorem is referenced by:  ltaprg  7620
  Copyright terms: Public domain W3C validator