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

Theorem addlocprlem 7648
Description: Lemma for addlocpr 7649. 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 7478 . . . . . 6  |-  <Q  C_  ( Q.  X.  Q. )
32brel 4727 . . . . 5  |-  ( Q 
<Q  R  ->  ( Q  e.  Q.  /\  R  e.  Q. ) )
43simpld 112 . . . 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 7588 . . . . . 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 7594 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
118, 9, 10syl2anc 411 . . . 4  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
13 prop 7588 . . . . . 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 7594 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
1714, 15, 16syl2anc 411 . . . 4  |-  ( ph  ->  E  e.  Q. )
18 addclnq 7488 . . . 4  |-  ( ( D  e.  Q.  /\  E  e.  Q. )  ->  ( D  +Q  E
)  e.  Q. )
1911, 17, 18syl2anc 411 . . 3  |-  ( ph  ->  ( D  +Q  E
)  e.  Q. )
20 nqtri3or 7509 . . 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 411 . 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 7644 . . . 4  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
29 orc 714 . . . 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 7646 . . . 4  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
32 olc 713 . . . 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 7647 . . . 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 1317 . 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 710    \/ w3o 980    = wceq 1373    e. wcel 2176   <.cop 3636   class class class wbr 4044   ` cfv 5271  (class class class)co 5944   1stc1st 6224   2ndc2nd 6225   Q.cnq 7393    +Q cplq 7395    <Q cltq 7398   P.cnp 7404    +P. cpp 7406
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-1o 6502  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-pli 7418  df-mi 7419  df-lti 7420  df-plpq 7457  df-mpq 7458  df-enq 7460  df-nqqs 7461  df-plqqs 7462  df-mqqs 7463  df-1nqqs 7464  df-rq 7465  df-ltnqqs 7466  df-inp 7579  df-iplp 7581
This theorem is referenced by:  addlocpr  7649
  Copyright terms: Public domain W3C validator