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

Theorem addlocprlemeqgt 7889
Description: Lemma for addlocpr 7893. This is a step used in both the  Q  =  ( D  +Q  E ) and  ( D  +Q  E
)  <Q  Q cases. (Contributed by Jim Kingdon, 7-Dec-2019.)
Hypotheses
Ref Expression
addlocprlem.a  |-  ( ph  ->  A  e.  P. )
addlocprlem.b  |-  ( ph  ->  B  e.  P. )
addlocprlem.qr  |-  ( ph  ->  Q  <Q  R )
addlocprlem.p  |-  ( ph  ->  P  e.  Q. )
addlocprlem.qppr  |-  ( ph  ->  ( Q  +Q  ( P  +Q  P ) )  =  R )
addlocprlem.dlo  |-  ( ph  ->  D  e.  ( 1st `  A ) )
addlocprlem.uup  |-  ( ph  ->  U  e.  ( 2nd `  A ) )
addlocprlem.du  |-  ( ph  ->  U  <Q  ( D  +Q  P ) )
addlocprlem.elo  |-  ( ph  ->  E  e.  ( 1st `  B ) )
addlocprlem.tup  |-  ( ph  ->  T  e.  ( 2nd `  B ) )
addlocprlem.et  |-  ( ph  ->  T  <Q  ( E  +Q  P ) )
Assertion
Ref Expression
addlocprlemeqgt  |-  ( ph  ->  ( U  +Q  T
)  <Q  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )

Proof of Theorem addlocprlemeqgt
Dummy variables  f  g  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 addlocprlem.du . . 3  |-  ( ph  ->  U  <Q  ( D  +Q  P ) )
2 addlocprlem.et . . 3  |-  ( ph  ->  T  <Q  ( E  +Q  P ) )
3 addlocprlem.a . . . . . 6  |-  ( ph  ->  A  e.  P. )
4 prop 7832 . . . . . 6  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
53, 4syl 14 . . . . 5  |-  ( ph  -> 
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P. )
6 addlocprlem.uup . . . . 5  |-  ( ph  ->  U  e.  ( 2nd `  A ) )
7 elprnqu 7839 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  U  e.  ( 2nd `  A ) )  ->  U  e.  Q. )
85, 6, 7syl2anc 415 . . . 4  |-  ( ph  ->  U  e.  Q. )
9 addlocprlem.dlo . . . . . 6  |-  ( ph  ->  D  e.  ( 1st `  A ) )
10 elprnql 7838 . . . . . 6  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
115, 9, 10syl2anc 415 . . . . 5  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.p . . . . 5  |-  ( ph  ->  P  e.  Q. )
13 addclnq 7732 . . . . 5  |-  ( ( D  e.  Q.  /\  P  e.  Q. )  ->  ( D  +Q  P
)  e.  Q. )
1411, 12, 13syl2anc 415 . . . 4  |-  ( ph  ->  ( D  +Q  P
)  e.  Q. )
15 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
16 prop 7832 . . . . . 6  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
1715, 16syl 14 . . . . 5  |-  ( ph  -> 
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P. )
18 addlocprlem.tup . . . . 5  |-  ( ph  ->  T  e.  ( 2nd `  B ) )
19 elprnqu 7839 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  T  e.  ( 2nd `  B ) )  ->  T  e.  Q. )
2017, 18, 19syl2anc 415 . . . 4  |-  ( ph  ->  T  e.  Q. )
21 addlocprlem.elo . . . . . 6  |-  ( ph  ->  E  e.  ( 1st `  B ) )
22 elprnql 7838 . . . . . 6  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
2317, 21, 22syl2anc 415 . . . . 5  |-  ( ph  ->  E  e.  Q. )
24 addclnq 7732 . . . . 5  |-  ( ( E  e.  Q.  /\  P  e.  Q. )  ->  ( E  +Q  P
)  e.  Q. )
2523, 12, 24syl2anc 415 . . . 4  |-  ( ph  ->  ( E  +Q  P
)  e.  Q. )
26 lt2addnq 7761 . . . 4  |-  ( ( ( U  e.  Q.  /\  ( D  +Q  P
)  e.  Q. )  /\  ( T  e.  Q.  /\  ( E  +Q  P
)  e.  Q. )
)  ->  ( ( U  <Q  ( D  +Q  P )  /\  T  <Q  ( E  +Q  P
) )  ->  ( U  +Q  T )  <Q 
( ( D  +Q  P )  +Q  ( E  +Q  P ) ) ) )
278, 14, 20, 25, 26syl22anc 1279 . . 3  |-  ( ph  ->  ( ( U  <Q  ( D  +Q  P )  /\  T  <Q  ( E  +Q  P ) )  ->  ( U  +Q  T )  <Q  (
( D  +Q  P
)  +Q  ( E  +Q  P ) ) ) )
281, 2, 27mp2and 437 . 2  |-  ( ph  ->  ( U  +Q  T
)  <Q  ( ( D  +Q  P )  +Q  ( E  +Q  P
) ) )
29 addcomnqg 7738 . . . 4  |-  ( ( f  e.  Q.  /\  g  e.  Q. )  ->  ( f  +Q  g
)  =  ( g  +Q  f ) )
3029adantl 277 . . 3  |-  ( (
ph  /\  ( f  e.  Q.  /\  g  e. 
Q. ) )  -> 
( f  +Q  g
)  =  ( g  +Q  f ) )
31 addassnqg 7739 . . . 4  |-  ( ( f  e.  Q.  /\  g  e.  Q.  /\  h  e.  Q. )  ->  (
( f  +Q  g
)  +Q  h )  =  ( f  +Q  ( g  +Q  h
) ) )
3231adantl 277 . . 3  |-  ( (
ph  /\  ( f  e.  Q.  /\  g  e. 
Q.  /\  h  e.  Q. ) )  ->  (
( f  +Q  g
)  +Q  h )  =  ( f  +Q  ( g  +Q  h
) ) )
33 addclnq 7732 . . . 4  |-  ( ( f  e.  Q.  /\  g  e.  Q. )  ->  ( f  +Q  g
)  e.  Q. )
3433adantl 277 . . 3  |-  ( (
ph  /\  ( f  e.  Q.  /\  g  e. 
Q. ) )  -> 
( f  +Q  g
)  e.  Q. )
3511, 12, 23, 30, 32, 12, 34caov4d 6264 . 2  |-  ( ph  ->  ( ( D  +Q  P )  +Q  ( E  +Q  P ) )  =  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )
3628, 35breqtrd 4151 1  |-  ( ph  ->  ( U  +Q  T
)  <Q  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   <.cop 3708   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   1stc1st 6362   2ndc2nd 6363   Q.cnq 7637    +Q cplq 7639    <Q cltq 7642   P.cnp 7648
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-eprel 4429  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-oadd 6681  df-omul 6682  df-er 6797  df-ec 6799  df-qs 6803  df-ni 7661  df-pli 7662  df-mi 7663  df-lti 7664  df-plpq 7701  df-enq 7704  df-nqqs 7705  df-plqqs 7706  df-ltnqqs 7710  df-inp 7823
This theorem is referenced by:  addlocprlemeq  7890  addlocprlemgt  7891
  Copyright terms: Public domain W3C validator