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

Theorem addlocprlem 6633
Description: Lemma for addlocpr 6634. 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 6463 . . . . . 6  |-  <Q  C_  ( Q.  X.  Q. )
32brel 4392 . . . . 5  |-  ( Q 
<Q  R  ->  ( Q  e.  Q.  /\  R  e.  Q. ) )
43simpld 105 . . . 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 6573 . . . . . 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 6579 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
118, 9, 10syl2anc 391 . . . 4  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
13 prop 6573 . . . . . 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 6579 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
1714, 15, 16syl2anc 391 . . . 4  |-  ( ph  ->  E  e.  Q. )
18 addclnq 6473 . . . 4  |-  ( ( D  e.  Q.  /\  E  e.  Q. )  ->  ( D  +Q  E
)  e.  Q. )
1911, 17, 18syl2anc 391 . . 3  |-  ( ph  ->  ( D  +Q  E
)  e.  Q. )
20 nqtri3or 6494 . . 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 391 . 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 6629 . . . 4  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
29 orc 633 . . . 4  |-  ( Q  e.  ( 1st `  ( A  +P.  B ) )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
3028, 29syl6 29 . . 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 6631 . . . 4  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
32 olc 632 . . . 4  |-  ( R  e.  ( 2nd `  ( A  +P.  B ) )  ->  ( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
3331, 32syl6 29 . . 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 6632 . . . 4  |-  ( ph  ->  ( ( D  +Q  E )  <Q  Q  ->  R  e.  ( 2nd `  ( A  +P.  B
) ) ) )
3534, 32syl6 29 . . 3  |-  ( ph  ->  ( ( D  +Q  E )  <Q  Q  -> 
( Q  e.  ( 1st `  ( A  +P.  B ) )  \/  R  e.  ( 2nd `  ( A  +P.  B ) ) ) ) )
3630, 33, 353jaod 1199 . 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 629    \/ w3o 884    = wceq 1243    e. wcel 1393   <.cop 3378   class class class wbr 3764   ` cfv 4902  (class class class)co 5512   1stc1st 5765   2ndc2nd 5766   Q.cnq 6378    +Q cplq 6380    <Q cltq 6383   P.cnp 6389    +P. cpp 6391
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451  df-inp 6564  df-iplp 6566
This theorem is referenced by:  addlocpr  6634
  Copyright terms: Public domain W3C validator