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

Theorem addlocprlemeqgt 7863
Description: Lemma for addlocpr 7867. 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 7806 . . . . . 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 7813 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  U  e.  ( 2nd `  A ) )  ->  U  e.  Q. )
85, 6, 7syl2anc 411 . . . 4  |-  ( ph  ->  U  e.  Q. )
9 addlocprlem.dlo . . . . . 6  |-  ( ph  ->  D  e.  ( 1st `  A ) )
10 elprnql 7812 . . . . . 6  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
115, 9, 10syl2anc 411 . . . . 5  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.p . . . . 5  |-  ( ph  ->  P  e.  Q. )
13 addclnq 7706 . . . . 5  |-  ( ( D  e.  Q.  /\  P  e.  Q. )  ->  ( D  +Q  P
)  e.  Q. )
1411, 12, 13syl2anc 411 . . . 4  |-  ( ph  ->  ( D  +Q  P
)  e.  Q. )
15 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
16 prop 7806 . . . . . 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 7813 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  T  e.  ( 2nd `  B ) )  ->  T  e.  Q. )
2017, 18, 19syl2anc 411 . . . 4  |-  ( ph  ->  T  e.  Q. )
21 addlocprlem.elo . . . . . 6  |-  ( ph  ->  E  e.  ( 1st `  B ) )
22 elprnql 7812 . . . . . 6  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
2317, 21, 22syl2anc 411 . . . . 5  |-  ( ph  ->  E  e.  Q. )
24 addclnq 7706 . . . . 5  |-  ( ( E  e.  Q.  /\  P  e.  Q. )  ->  ( E  +Q  P
)  e.  Q. )
2523, 12, 24syl2anc 411 . . . 4  |-  ( ph  ->  ( E  +Q  P
)  e.  Q. )
26 lt2addnq 7735 . . . 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 1275 . . 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 433 . 2  |-  ( ph  ->  ( U  +Q  T
)  <Q  ( ( D  +Q  P )  +Q  ( E  +Q  P
) ) )
29 addcomnqg 7712 . . . 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 7713 . . . 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 7706 . . . 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 6247 . 2  |-  ( ph  ->  ( ( D  +Q  P )  +Q  ( E  +Q  P ) )  =  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )
3628, 35breqtrd 4140 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 1005    = wceq 1398    e. wcel 2205   <.cop 3697   class class class wbr 4114   ` cfv 5357  (class class class)co 6058   1stc1st 6345   2ndc2nd 6346   Q.cnq 7611    +Q cplq 7613    <Q cltq 7616   P.cnp 7622
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-ltnqqs 7684  df-inp 7797
This theorem is referenced by:  addlocprlemeq  7864  addlocprlemgt  7865
  Copyright terms: Public domain W3C validator