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

Theorem addpinq1 7647
Description: Addition of one to the numerator of a fraction whose denominator is one. (Contributed by Jim Kingdon, 26-Apr-2020.)
Assertion
Ref Expression
addpinq1  |-  ( A  e.  N.  ->  [ <. ( A  +N  1o ) ,  1o >. ]  ~Q  =  ( [ <. A ,  1o >. ]  ~Q  +Q  1Q ) )

Proof of Theorem addpinq1
StepHypRef Expression
1 df-1nqqs 7534 . . . . 5  |-  1Q  =  [ <. 1o ,  1o >. ]  ~Q
21oveq2i 6011 . . . 4  |-  ( [
<. A ,  1o >. ]  ~Q  +Q  1Q )  =  ( [ <. A ,  1o >. ]  ~Q  +Q  [ <. 1o ,  1o >. ]  ~Q  )
3 1pi 7498 . . . . 5  |-  1o  e.  N.
4 addpipqqs 7553 . . . . . 6  |-  ( ( ( A  e.  N.  /\  1o  e.  N. )  /\  ( 1o  e.  N.  /\  1o  e.  N. )
)  ->  ( [ <. A ,  1o >. ]  ~Q  +Q  [ <. 1o ,  1o >. ]  ~Q  )  =  [ <. (
( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>. ]  ~Q  )
53, 3, 4mpanr12 439 . . . . 5  |-  ( ( A  e.  N.  /\  1o  e.  N. )  -> 
( [ <. A ,  1o >. ]  ~Q  +Q  [
<. 1o ,  1o >. ]  ~Q  )  =  [ <. ( ( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o ) >. ]  ~Q  )
63, 5mpan2 425 . . . 4  |-  ( A  e.  N.  ->  ( [ <. A ,  1o >. ]  ~Q  +Q  [ <. 1o ,  1o >. ]  ~Q  )  =  [ <. ( ( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o ) >. ]  ~Q  )
72, 6eqtrid 2274 . . 3  |-  ( A  e.  N.  ->  ( [ <. A ,  1o >. ]  ~Q  +Q  1Q )  =  [ <. (
( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>. ]  ~Q  )
8 mulidpi 7501 . . . . . . 7  |-  ( 1o  e.  N.  ->  ( 1o  .N  1o )  =  1o )
93, 8ax-mp 5 . . . . . 6  |-  ( 1o 
.N  1o )  =  1o
109oveq2i 6011 . . . . 5  |-  ( ( A  .N  1o )  +N  ( 1o  .N  1o ) )  =  ( ( A  .N  1o )  +N  1o )
1110, 9opeq12i 3861 . . . 4  |-  <. (
( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>.  =  <. ( ( A  .N  1o )  +N  1o ) ,  1o >.
12 eceq1 6713 . . . 4  |-  ( <.
( ( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o ) >.  =  <. ( ( A  .N  1o )  +N  1o ) ,  1o >.  ->  [ <. ( ( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>. ]  ~Q  =  [ <. ( ( A  .N  1o )  +N  1o ) ,  1o >. ]  ~Q  )
1311, 12ax-mp 5 . . 3  |-  [ <. ( ( A  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>. ]  ~Q  =  [ <. ( ( A  .N  1o )  +N  1o ) ,  1o >. ]  ~Q
147, 13eqtrdi 2278 . 2  |-  ( A  e.  N.  ->  ( [ <. A ,  1o >. ]  ~Q  +Q  1Q )  =  [ <. (
( A  .N  1o )  +N  1o ) ,  1o >. ]  ~Q  )
15 mulidpi 7501 . . . . 5  |-  ( A  e.  N.  ->  ( A  .N  1o )  =  A )
1615oveq1d 6015 . . . 4  |-  ( A  e.  N.  ->  (
( A  .N  1o )  +N  1o )  =  ( A  +N  1o ) )
1716opeq1d 3862 . . 3  |-  ( A  e.  N.  ->  <. (
( A  .N  1o )  +N  1o ) ,  1o >.  =  <. ( A  +N  1o ) ,  1o >. )
1817eceq1d 6714 . 2  |-  ( A  e.  N.  ->  [ <. ( ( A  .N  1o )  +N  1o ) ,  1o >. ]  ~Q  =  [ <. ( A  +N  1o ) ,  1o >. ]  ~Q  )
1914, 18eqtr2d 2263 1  |-  ( A  e.  N.  ->  [ <. ( A  +N  1o ) ,  1o >. ]  ~Q  =  ( [ <. A ,  1o >. ]  ~Q  +Q  1Q ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   <.cop 3669  (class class class)co 6000   1oc1o 6553   [cec 6676   N.cnpi 7455    +N cpli 7456    .N cmi 7457    ~Q ceq 7462   1Qc1q 7464    +Q cplq 7465
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-irdg 6514  df-1o 6560  df-oadd 6564  df-omul 6565  df-er 6678  df-ec 6680  df-qs 6684  df-ni 7487  df-pli 7488  df-mi 7489  df-plpq 7527  df-enq 7530  df-nqqs 7531  df-plqqs 7532  df-1nqqs 7534
This theorem is referenced by:  pitonnlem2  8030
  Copyright terms: Public domain W3C validator