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

Theorem addlocprlemlt 7532
Description: Lemma for addlocpr 7537. 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 7366 . . . . 5  |-  <Q  C_  ( Q.  X.  Q. )
98brel 4680 . . . 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 7530 . 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 1237 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 1353    e. wcel 2148   class class class wbr 4005   ` cfv 5218  (class class class)co 5877   1stc1st 6141   2ndc2nd 6142   Q.cnq 7281    +Q cplq 7283    <Q cltq 7286   P.cnp 7292    +P. cpp 7294
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-eprel 4291  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-1o 6419  df-oadd 6423  df-omul 6424  df-er 6537  df-ec 6539  df-qs 6543  df-ni 7305  df-pli 7306  df-mi 7307  df-lti 7308  df-plpq 7345  df-mpq 7346  df-enq 7348  df-nqqs 7349  df-plqqs 7350  df-mqqs 7351  df-1nqqs 7352  df-rq 7353  df-ltnqqs 7354  df-inp 7467  df-iplp 7469
This theorem is referenced by:  addlocprlem  7536
  Copyright terms: Public domain W3C validator