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

Theorem addlocprlemeq 7341
Description: Lemma for addlocpr 7344. The  Q  =  ( D  +Q  E ) case. (Contributed by Jim Kingdon, 6-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
addlocprlemeq  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )

Proof of Theorem addlocprlemeq
StepHypRef Expression
1 addlocprlem.a . . . . . 6  |-  ( ph  ->  A  e.  P. )
2 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
3 addlocprlem.qr . . . . . 6  |-  ( ph  ->  Q  <Q  R )
4 addlocprlem.p . . . . . 6  |-  ( ph  ->  P  e.  Q. )
5 addlocprlem.qppr . . . . . 6  |-  ( ph  ->  ( Q  +Q  ( P  +Q  P ) )  =  R )
6 addlocprlem.dlo . . . . . 6  |-  ( ph  ->  D  e.  ( 1st `  A ) )
7 addlocprlem.uup . . . . . 6  |-  ( ph  ->  U  e.  ( 2nd `  A ) )
8 addlocprlem.du . . . . . 6  |-  ( ph  ->  U  <Q  ( D  +Q  P ) )
9 addlocprlem.elo . . . . . 6  |-  ( ph  ->  E  e.  ( 1st `  B ) )
10 addlocprlem.tup . . . . . 6  |-  ( ph  ->  T  e.  ( 2nd `  B ) )
11 addlocprlem.et . . . . . 6  |-  ( ph  ->  T  <Q  ( E  +Q  P ) )
121, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11addlocprlemeqgt 7340 . . . . 5  |-  ( ph  ->  ( U  +Q  T
)  <Q  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )
1312adantr 274 . . . 4  |-  ( (
ph  /\  Q  =  ( D  +Q  E
) )  ->  ( U  +Q  T )  <Q 
( ( D  +Q  E )  +Q  ( P  +Q  P ) ) )
14 oveq1 5781 . . . . 5  |-  ( Q  =  ( D  +Q  E )  ->  ( Q  +Q  ( P  +Q  P ) )  =  ( ( D  +Q  E )  +Q  ( P  +Q  P ) ) )
155, 14sylan9req 2193 . . . 4  |-  ( (
ph  /\  Q  =  ( D  +Q  E
) )  ->  R  =  ( ( D  +Q  E )  +Q  ( P  +Q  P
) ) )
1613, 15breqtrrd 3956 . . 3  |-  ( (
ph  /\  Q  =  ( D  +Q  E
) )  ->  ( U  +Q  T )  <Q  R )
171, 7jca 304 . . . . 5  |-  ( ph  ->  ( A  e.  P.  /\  U  e.  ( 2nd `  A ) ) )
182, 10jca 304 . . . . 5  |-  ( ph  ->  ( B  e.  P.  /\  T  e.  ( 2nd `  B ) ) )
19 ltrelnq 7173 . . . . . . . 8  |-  <Q  C_  ( Q.  X.  Q. )
2019brel 4591 . . . . . . 7  |-  ( Q 
<Q  R  ->  ( Q  e.  Q.  /\  R  e.  Q. ) )
2120simprd 113 . . . . . 6  |-  ( Q 
<Q  R  ->  R  e. 
Q. )
223, 21syl 14 . . . . 5  |-  ( ph  ->  R  e.  Q. )
23 addnqpru 7338 . . . . 5  |-  ( ( ( ( A  e. 
P.  /\  U  e.  ( 2nd `  A ) )  /\  ( B  e.  P.  /\  T  e.  ( 2nd `  B
) ) )  /\  R  e.  Q. )  ->  ( ( U  +Q  T )  <Q  R  ->  R  e.  ( 2nd `  ( A  +P.  B
) ) ) )
2417, 18, 22, 23syl21anc 1215 . . . 4  |-  ( ph  ->  ( ( U  +Q  T )  <Q  R  ->  R  e.  ( 2nd `  ( A  +P.  B
) ) ) )
2524adantr 274 . . 3  |-  ( (
ph  /\  Q  =  ( D  +Q  E
) )  ->  (
( U  +Q  T
)  <Q  R  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
2616, 25mpd 13 . 2  |-  ( (
ph  /\  Q  =  ( D  +Q  E
) )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) )
2726ex 114 1  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   class class class wbr 3929   ` cfv 5123  (class class class)co 5774   1stc1st 6036   2ndc2nd 6037   Q.cnq 7088    +Q cplq 7090    <Q cltq 7093   P.cnp 7099    +P. cpp 7101
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-eprel 4211  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-1o 6313  df-oadd 6317  df-omul 6318  df-er 6429  df-ec 6431  df-qs 6435  df-ni 7112  df-pli 7113  df-mi 7114  df-lti 7115  df-plpq 7152  df-mpq 7153  df-enq 7155  df-nqqs 7156  df-plqqs 7157  df-mqqs 7158  df-1nqqs 7159  df-rq 7160  df-ltnqqs 7161  df-inp 7274  df-iplp 7276
This theorem is referenced by:  addlocprlem  7343
  Copyright terms: Public domain W3C validator