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

Theorem addlocprlemlt 7718
Description: Lemma for addlocpr 7723. The  Q  <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
addlocprlemlt  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )

Proof of Theorem addlocprlemlt
StepHypRef Expression
1 addlocprlem.a . . 3  |-  ( ph  ->  A  e.  P. )
2 addlocprlem.dlo . . 3  |-  ( ph  ->  D  e.  ( 1st `  A ) )
31, 2jca 306 . 2  |-  ( ph  ->  ( A  e.  P.  /\  D  e.  ( 1st `  A ) ) )
4 addlocprlem.b . . 3  |-  ( ph  ->  B  e.  P. )
5 addlocprlem.elo . . 3  |-  ( ph  ->  E  e.  ( 1st `  B ) )
64, 5jca 306 . 2  |-  ( ph  ->  ( B  e.  P.  /\  E  e.  ( 1st `  B ) ) )
7 addlocprlem.qr . . 3  |-  ( ph  ->  Q  <Q  R )
8 ltrelnq 7552 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
98brel 4771 . . . 4  |-  ( Q 
<Q  R  ->  ( Q  e.  Q.  /\  R  e.  Q. ) )
109simpld 112 . . 3  |-  ( Q 
<Q  R  ->  Q  e. 
Q. )
117, 10syl 14 . 2  |-  ( ph  ->  Q  e.  Q. )
12 addnqprl 7716 . 2  |-  ( ( ( ( A  e. 
P.  /\  D  e.  ( 1st `  A ) )  /\  ( B  e.  P.  /\  E  e.  ( 1st `  B
) ) )  /\  Q  e.  Q. )  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
133, 6, 11, 12syl21anc 1270 1  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   class class class wbr 4083   ` cfv 5318  (class class class)co 6001   1stc1st 6284   2ndc2nd 6285   Q.cnq 7467    +Q cplq 7469    <Q cltq 7472   P.cnp 7478    +P. cpp 7480
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-eprel 4380  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-irdg 6516  df-1o 6562  df-oadd 6566  df-omul 6567  df-er 6680  df-ec 6682  df-qs 6686  df-ni 7491  df-pli 7492  df-mi 7493  df-lti 7494  df-plpq 7531  df-mpq 7532  df-enq 7534  df-nqqs 7535  df-plqqs 7536  df-mqqs 7537  df-1nqqs 7538  df-rq 7539  df-ltnqqs 7540  df-inp 7653  df-iplp 7655
This theorem is referenced by:  addlocprlem  7722
  Copyright terms: Public domain W3C validator