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

Theorem addlocprlem 7155
Description: Lemma for addlocpr 7156. The result, in deduction form. (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
addlocprlem  |-  ( ph  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )

Proof of Theorem addlocprlem
StepHypRef Expression
1 addlocprlem.qr . . . 4  |-  ( ph  ->  Q  <Q  R )
2 ltrelnq 6985 . . . . . 6  |-  <Q  C_  ( Q.  X.  Q. )
32brel 4503 . . . . 5  |-  ( Q 
<Q  R  ->  ( Q  e.  Q.  /\  R  e.  Q. ) )
43simpld 111 . . . 4  |-  ( Q 
<Q  R  ->  Q  e. 
Q. )
51, 4syl 14 . . 3  |-  ( ph  ->  Q  e.  Q. )
6 addlocprlem.a . . . . . 6  |-  ( ph  ->  A  e.  P. )
7 prop 7095 . . . . . 6  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
86, 7syl 14 . . . . 5  |-  ( ph  -> 
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P. )
9 addlocprlem.dlo . . . . 5  |-  ( ph  ->  D  e.  ( 1st `  A ) )
10 elprnql 7101 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
118, 9, 10syl2anc 404 . . . 4  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
13 prop 7095 . . . . . 6  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
1412, 13syl 14 . . . . 5  |-  ( ph  -> 
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P. )
15 addlocprlem.elo . . . . 5  |-  ( ph  ->  E  e.  ( 1st `  B ) )
16 elprnql 7101 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
1714, 15, 16syl2anc 404 . . . 4  |-  ( ph  ->  E  e.  Q. )
18 addclnq 6995 . . . 4  |-  ( ( D  e.  Q.  /\  E  e.  Q. )  ->  ( D  +Q  E
)  e.  Q. )
1911, 17, 18syl2anc 404 . . 3  |-  ( ph  ->  ( D  +Q  E
)  e.  Q. )
20 nqtri3or 7016 . . 3  |-  ( ( Q  e.  Q.  /\  ( D  +Q  E
)  e.  Q. )  ->  ( Q  <Q  ( D  +Q  E )  \/  Q  =  ( D  +Q  E )  \/  ( D  +Q  E
)  <Q  Q ) )
215, 19, 20syl2anc 404 . 2  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  \/  Q  =  ( D  +Q  E )  \/  ( D  +Q  E
)  <Q  Q ) )
22 addlocprlem.p . . . . 5  |-  ( ph  ->  P  e.  Q. )
23 addlocprlem.qppr . . . . 5  |-  ( ph  ->  ( Q  +Q  ( P  +Q  P ) )  =  R )
24 addlocprlem.uup . . . . 5  |-  ( ph  ->  U  e.  ( 2nd `  A ) )
25 addlocprlem.du . . . . 5  |-  ( ph  ->  U  <Q  ( D  +Q  P ) )
26 addlocprlem.tup . . . . 5  |-  ( ph  ->  T  e.  ( 2nd `  B ) )
27 addlocprlem.et . . . . 5  |-  ( ph  ->  T  <Q  ( E  +Q  P ) )
286, 12, 1, 22, 23, 9, 24, 25, 15, 26, 27addlocprlemlt 7151 . . . 4  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
29 orc 669 . . . 4  |-  ( Q  e.  ( 1st `  ( A  +P.  B ) )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
3028, 29syl6 33 . . 3  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  -> 
( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
316, 12, 1, 22, 23, 9, 24, 25, 15, 26, 27addlocprlemeq 7153 . . . 4  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
32 olc 668 . . . 4  |-  ( R  e.  ( 2nd `  ( A  +P.  B ) )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
3331, 32syl6 33 . . 3  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
346, 12, 1, 22, 23, 9, 24, 25, 15, 26, 27addlocprlemgt 7154 . . . 4  |-  ( ph  ->  ( ( D  +Q  E )  <Q  Q  ->  R  e.  ( 2nd `  ( A  +P.  B
) ) ) )
3534, 32syl6 33 . . 3  |-  ( ph  ->  ( ( D  +Q  E )  <Q  Q  -> 
( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
3630, 33, 353jaod 1241 . 2  |-  ( ph  ->  ( ( Q  <Q  ( D  +Q  E )  \/  Q  =  ( D  +Q  E )  \/  ( D  +Q  E )  <Q  Q )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
3721, 36mpd 13 1  |-  ( ph  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 665    \/ w3o 924    = wceq 1290    e. wcel 1439   <.cop 3453   class class class wbr 3851   ` cfv 5028  (class class class)co 5666   1stc1st 5923   2ndc2nd 5924   Q.cnq 6900    +Q cplq 6902    <Q cltq 6905   P.cnp 6911    +P. cpp 6913
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-nul 3971  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-iinf 4416
This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-int 3695  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-tr 3943  df-eprel 4125  df-id 4129  df-po 4132  df-iso 4133  df-iord 4202  df-on 4204  df-suc 4207  df-iom 4419  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-rn 4463  df-res 4464  df-ima 4465  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-1st 5925  df-2nd 5926  df-recs 6084  df-irdg 6149  df-1o 6195  df-oadd 6199  df-omul 6200  df-er 6306  df-ec 6308  df-qs 6312  df-ni 6924  df-pli 6925  df-mi 6926  df-lti 6927  df-plpq 6964  df-mpq 6965  df-enq 6967  df-nqqs 6968  df-plqqs 6969  df-mqqs 6970  df-1nqqs 6971  df-rq 6972  df-ltnqqs 6973  df-inp 7086  df-iplp 7088
This theorem is referenced by:  addlocpr  7156
  Copyright terms: Public domain W3C validator