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

Theorem addpipqqs 6468
Description: Addition of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.)
Assertion
Ref Expression
addpipqqs  |-  ( ( ( A  e.  N.  /\  B  e.  N. )  /\  ( C  e.  N.  /\  D  e.  N. )
)  ->  ( [ <. A ,  B >. ]  ~Q  +Q  [ <. C ,  D >. ]  ~Q  )  =  [ <. (
( A  .N  D
)  +N  ( B  .N  C ) ) ,  ( B  .N  D ) >. ]  ~Q  )

Proof of Theorem addpipqqs
Dummy variables  x  y  z  w  v  u  t  s  f  g  h  a  b  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 addpipqqslem 6467 . 2  |-  ( ( ( A  e.  N.  /\  B  e.  N. )  /\  ( C  e.  N.  /\  D  e.  N. )
)  ->  <. ( ( A  .N  D )  +N  ( B  .N  C ) ) ,  ( B  .N  D
) >.  e.  ( N. 
X.  N. ) )
2 addpipqqslem 6467 . 2  |-  ( ( ( a  e.  N.  /\  b  e.  N. )  /\  ( g  e.  N.  /\  h  e.  N. )
)  ->  <. ( ( a  .N  h )  +N  ( b  .N  g ) ) ,  ( b  .N  h
) >.  e.  ( N. 
X.  N. ) )
3 addpipqqslem 6467 . 2  |-  ( ( ( c  e.  N.  /\  d  e.  N. )  /\  ( t  e.  N.  /\  s  e.  N. )
)  ->  <. ( ( c  .N  s )  +N  ( d  .N  t ) ) ,  ( d  .N  s
) >.  e.  ( N. 
X.  N. ) )
4 enqex 6458 . 2  |-  ~Q  e.  _V
5 enqer 6456 . 2  |-  ~Q  Er  ( N.  X.  N. )
6 df-enq 6445 . 2  |-  ~Q  =  { <. x ,  y
>.  |  ( (
x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ( z  .N  u
)  =  ( w  .N  v ) ) ) }
7 oveq12 5521 . . . 4  |-  ( ( z  =  a  /\  u  =  d )  ->  ( z  .N  u
)  =  ( a  .N  d ) )
8 oveq12 5521 . . . 4  |-  ( ( w  =  b  /\  v  =  c )  ->  ( w  .N  v
)  =  ( b  .N  c ) )
97, 8eqeqan12d 2055 . . 3  |-  ( ( ( z  =  a  /\  u  =  d )  /\  ( w  =  b  /\  v  =  c ) )  ->  ( ( z  .N  u )  =  ( w  .N  v
)  <->  ( a  .N  d )  =  ( b  .N  c ) ) )
109an42s 523 . 2  |-  ( ( ( z  =  a  /\  w  =  b )  /\  ( v  =  c  /\  u  =  d ) )  ->  ( ( z  .N  u )  =  ( w  .N  v
)  <->  ( a  .N  d )  =  ( b  .N  c ) ) )
11 oveq12 5521 . . . 4  |-  ( ( z  =  g  /\  u  =  s )  ->  ( z  .N  u
)  =  ( g  .N  s ) )
12 oveq12 5521 . . . 4  |-  ( ( w  =  h  /\  v  =  t )  ->  ( w  .N  v
)  =  ( h  .N  t ) )
1311, 12eqeqan12d 2055 . . 3  |-  ( ( ( z  =  g  /\  u  =  s )  /\  ( w  =  h  /\  v  =  t ) )  ->  ( ( z  .N  u )  =  ( w  .N  v
)  <->  ( g  .N  s )  =  ( h  .N  t ) ) )
1413an42s 523 . 2  |-  ( ( ( z  =  g  /\  w  =  h )  /\  ( v  =  t  /\  u  =  s ) )  ->  ( ( z  .N  u )  =  ( w  .N  v
)  <->  ( g  .N  s )  =  ( h  .N  t ) ) )
15 dfplpq2 6452 . 2  |-  +pQ  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. )
)  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  <. ( ( w  .N  f
)  +N  ( v  .N  u ) ) ,  ( v  .N  f ) >. )
) }
16 oveq12 5521 . . . . 5  |-  ( ( w  =  a  /\  f  =  h )  ->  ( w  .N  f
)  =  ( a  .N  h ) )
17 oveq12 5521 . . . . 5  |-  ( ( v  =  b  /\  u  =  g )  ->  ( v  .N  u
)  =  ( b  .N  g ) )
1816, 17oveqan12d 5531 . . . 4  |-  ( ( ( w  =  a  /\  f  =  h )  /\  ( v  =  b  /\  u  =  g ) )  ->  ( ( w  .N  f )  +N  ( v  .N  u
) )  =  ( ( a  .N  h
)  +N  ( b  .N  g ) ) )
1918an42s 523 . . 3  |-  ( ( ( w  =  a  /\  v  =  b )  /\  ( u  =  g  /\  f  =  h ) )  -> 
( ( w  .N  f )  +N  (
v  .N  u ) )  =  ( ( a  .N  h )  +N  ( b  .N  g ) ) )
20 oveq12 5521 . . . 4  |-  ( ( v  =  b  /\  f  =  h )  ->  ( v  .N  f
)  =  ( b  .N  h ) )
2120ad2ant2l 477 . . 3  |-  ( ( ( w  =  a  /\  v  =  b )  /\  ( u  =  g  /\  f  =  h ) )  -> 
( v  .N  f
)  =  ( b  .N  h ) )
2219, 21opeq12d 3557 . 2  |-  ( ( ( w  =  a  /\  v  =  b )  /\  ( u  =  g  /\  f  =  h ) )  ->  <. ( ( w  .N  f )  +N  (
v  .N  u ) ) ,  ( v  .N  f ) >.  =  <. ( ( a  .N  h )  +N  ( b  .N  g
) ) ,  ( b  .N  h )
>. )
23 oveq12 5521 . . . . 5  |-  ( ( w  =  c  /\  f  =  s )  ->  ( w  .N  f
)  =  ( c  .N  s ) )
24 oveq12 5521 . . . . 5  |-  ( ( v  =  d  /\  u  =  t )  ->  ( v  .N  u
)  =  ( d  .N  t ) )
2523, 24oveqan12d 5531 . . . 4  |-  ( ( ( w  =  c  /\  f  =  s )  /\  ( v  =  d  /\  u  =  t ) )  ->  ( ( w  .N  f )  +N  ( v  .N  u
) )  =  ( ( c  .N  s
)  +N  ( d  .N  t ) ) )
2625an42s 523 . . 3  |-  ( ( ( w  =  c  /\  v  =  d )  /\  ( u  =  t  /\  f  =  s ) )  ->  ( ( w  .N  f )  +N  ( v  .N  u
) )  =  ( ( c  .N  s
)  +N  ( d  .N  t ) ) )
27 oveq12 5521 . . . 4  |-  ( ( v  =  d  /\  f  =  s )  ->  ( v  .N  f
)  =  ( d  .N  s ) )
2827ad2ant2l 477 . . 3  |-  ( ( ( w  =  c  /\  v  =  d )  /\  ( u  =  t  /\  f  =  s ) )  ->  ( v  .N  f )  =  ( d  .N  s ) )
2926, 28opeq12d 3557 . 2  |-  ( ( ( w  =  c  /\  v  =  d )  /\  ( u  =  t  /\  f  =  s ) )  ->  <. ( ( w  .N  f )  +N  ( v  .N  u
) ) ,  ( v  .N  f )
>.  =  <. ( ( c  .N  s )  +N  ( d  .N  t ) ) ,  ( d  .N  s
) >. )
30 oveq12 5521 . . . . 5  |-  ( ( w  =  A  /\  f  =  D )  ->  ( w  .N  f
)  =  ( A  .N  D ) )
31 oveq12 5521 . . . . 5  |-  ( ( v  =  B  /\  u  =  C )  ->  ( v  .N  u
)  =  ( B  .N  C ) )
3230, 31oveqan12d 5531 . . . 4  |-  ( ( ( w  =  A  /\  f  =  D )  /\  ( v  =  B  /\  u  =  C ) )  -> 
( ( w  .N  f )  +N  (
v  .N  u ) )  =  ( ( A  .N  D )  +N  ( B  .N  C ) ) )
3332an42s 523 . . 3  |-  ( ( ( w  =  A  /\  v  =  B )  /\  ( u  =  C  /\  f  =  D ) )  -> 
( ( w  .N  f )  +N  (
v  .N  u ) )  =  ( ( A  .N  D )  +N  ( B  .N  C ) ) )
34 oveq12 5521 . . . 4  |-  ( ( v  =  B  /\  f  =  D )  ->  ( v  .N  f
)  =  ( B  .N  D ) )
3534ad2ant2l 477 . . 3  |-  ( ( ( w  =  A  /\  v  =  B )  /\  ( u  =  C  /\  f  =  D ) )  -> 
( v  .N  f
)  =  ( B  .N  D ) )
3633, 35opeq12d 3557 . 2  |-  ( ( ( w  =  A  /\  v  =  B )  /\  ( u  =  C  /\  f  =  D ) )  ->  <. ( ( w  .N  f )  +N  (
v  .N  u ) ) ,  ( v  .N  f ) >.  =  <. ( ( A  .N  D )  +N  ( B  .N  C
) ) ,  ( B  .N  D )
>. )
37 df-plqqs 6447 . 2  |-  +Q  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e. 
Q.  /\  y  e.  Q. )  /\  E. a E. b E. c E. d ( ( x  =  [ <. a ,  b >. ]  ~Q  /\  y  =  [ <. c ,  d >. ]  ~Q  )  /\  z  =  [
( <. a ,  b
>.  +pQ  <. c ,  d
>. ) ]  ~Q  )
) }
38 df-nqqs 6446 . 2  |-  Q.  =  ( ( N.  X.  N. ) /.  ~Q  )
39 addcmpblnq 6465 . 2  |-  ( ( ( ( a  e. 
N.  /\  b  e.  N. )  /\  (
c  e.  N.  /\  d  e.  N. )
)  /\  ( (
g  e.  N.  /\  h  e.  N. )  /\  ( t  e.  N.  /\  s  e.  N. )
) )  ->  (
( ( a  .N  d )  =  ( b  .N  c )  /\  ( g  .N  s )  =  ( h  .N  t ) )  ->  <. ( ( a  .N  h )  +N  ( b  .N  g ) ) ,  ( b  .N  h
) >.  ~Q  <. ( ( c  .N  s )  +N  ( d  .N  t ) ) ,  ( d  .N  s
) >. ) )
401, 2, 3, 4, 5, 6, 10, 14, 15, 22, 29, 36, 37, 38, 39oviec 6212 1  |-  ( ( ( A  e.  N.  /\  B  e.  N. )  /\  ( C  e.  N.  /\  D  e.  N. )
)  ->  ( [ <. A ,  B >. ]  ~Q  +Q  [ <. C ,  D >. ]  ~Q  )  =  [ <. (
( A  .N  D
)  +N  ( B  .N  C ) ) ,  ( B  .N  D ) >. ]  ~Q  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    = wceq 1243    e. wcel 1393   <.cop 3378  (class class class)co 5512   [cec 6104   N.cnpi 6370    +N cpli 6371    .N cmi 6372    +pQ cplpq 6374    ~Q ceq 6377   Q.cnq 6378    +Q cplq 6380
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-id 4030  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-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-plpq 6442  df-enq 6445  df-nqqs 6446  df-plqqs 6447
This theorem is referenced by:  addclnq  6473  addcomnqg  6479  addassnqg  6480  distrnqg  6485  ltanqg  6498  1lt2nq  6504  ltexnqq  6506  nqnq0a  6552  addpinq1  6562
  Copyright terms: Public domain W3C validator