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

Theorem addlocprlem 7336
Description: Lemma for addlocpr 7337. 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 7166 . . . . . 6  |-  <Q  C_  ( Q.  X.  Q. )
32brel 4586 . . . . 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 7276 . . . . . 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 7282 . . . . 5  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  D  e.  ( 1st `  A ) )  ->  D  e.  Q. )
118, 9, 10syl2anc 408 . . . 4  |-  ( ph  ->  D  e.  Q. )
12 addlocprlem.b . . . . . 6  |-  ( ph  ->  B  e.  P. )
13 prop 7276 . . . . . 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 7282 . . . . 5  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  E  e.  ( 1st `  B ) )  ->  E  e.  Q. )
1714, 15, 16syl2anc 408 . . . 4  |-  ( ph  ->  E  e.  Q. )
18 addclnq 7176 . . . 4  |-  ( ( D  e.  Q.  /\  E  e.  Q. )  ->  ( D  +Q  E
)  e.  Q. )
1911, 17, 18syl2anc 408 . . 3  |-  ( ph  ->  ( D  +Q  E
)  e.  Q. )
20 nqtri3or 7197 . . 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 408 . 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 7332 . . . 4  |-  ( ph  ->  ( Q  <Q  ( D  +Q  E )  ->  Q  e.  ( 1st `  ( A  +P.  B
) ) ) )
29 orc 701 . . . 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 7334 . . . 4  |-  ( ph  ->  ( Q  =  ( D  +Q  E )  ->  R  e.  ( 2nd `  ( A  +P.  B ) ) ) )
32 olc 700 . . . 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 7335 . . . 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 1282 . 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 697    \/ w3o 961    = wceq 1331    e. wcel 1480   <.cop 3525   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   1stc1st 6029   2ndc2nd 6030   Q.cnq 7081    +Q cplq 7083    <Q cltq 7086   P.cnp 7092    +P. cpp 7094
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-inp 7267  df-iplp 7269
This theorem is referenced by:  addlocpr  7337
  Copyright terms: Public domain W3C validator