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

Theorem addlocprlemlt 7593
Description: Lemma for addlocpr 7598. 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 7427 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
98brel 4712 . . . 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 7591 . 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 1248 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 1364    e. wcel 2164   class class class wbr 4030   ` cfv 5255  (class class class)co 5919   1stc1st 6193   2ndc2nd 6194   Q.cnq 7342    +Q cplq 7344    <Q cltq 7347   P.cnp 7353    +P. cpp 7355
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-eprel 4321  df-id 4325  df-iord 4398  df-on 4400  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-1o 6471  df-oadd 6475  df-omul 6476  df-er 6589  df-ec 6591  df-qs 6595  df-ni 7366  df-pli 7367  df-mi 7368  df-lti 7369  df-plpq 7406  df-mpq 7407  df-enq 7409  df-nqqs 7410  df-plqqs 7411  df-mqqs 7412  df-1nqqs 7413  df-rq 7414  df-ltnqqs 7415  df-inp 7528  df-iplp 7530
This theorem is referenced by:  addlocprlem  7597
  Copyright terms: Public domain W3C validator