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

Theorem recidpipr 7657
Description: Another way of saying that a number times its reciprocal is one. (Contributed by Jim Kingdon, 17-Jul-2021.)
Assertion
Ref Expression
recidpipr  |-  ( N  e.  N.  ->  ( <. { l  |  l 
<Q  [ <. N ,  1o >. ]  ~Q  } ,  { u  |  [ <. N ,  1o >. ]  ~Q  <Q  u } >.  .P.  <. { l  |  l  <Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  <Q  u } >. )  =  1P )
Distinct variable group:    N, l, u

Proof of Theorem recidpipr
StepHypRef Expression
1 nnnq 7223 . . 3  |-  ( N  e.  N.  ->  [ <. N ,  1o >. ]  ~Q  e.  Q. )
2 recclnq 7193 . . . 4  |-  ( [
<. N ,  1o >. ]  ~Q  e.  Q.  ->  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  e.  Q. )
31, 2syl 14 . . 3  |-  ( N  e.  N.  ->  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  e.  Q. )
4 mulnqpr 7378 . . 3  |-  ( ( [ <. N ,  1o >. ]  ~Q  e.  Q.  /\  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  e.  Q. )  ->  <. { l  |  l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q
`  [ <. N ,  1o >. ]  ~Q  )
) } ,  {
u  |  ( [
<. N ,  1o >. ]  ~Q  .Q  ( *Q
`  [ <. N ,  1o >. ]  ~Q  )
)  <Q  u } >.  =  ( <. { l  |  l  <Q  [ <. N ,  1o >. ]  ~Q  } ,  { u  |  [ <. N ,  1o >. ]  ~Q  <Q  u } >.  .P.  <. { l  |  l  <Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  <Q  u } >. ) )
51, 3, 4syl2anc 408 . 2  |-  ( N  e.  N.  ->  <. { l  |  l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
) } ,  {
u  |  ( [
<. N ,  1o >. ]  ~Q  .Q  ( *Q
`  [ <. N ,  1o >. ]  ~Q  )
)  <Q  u } >.  =  ( <. { l  |  l  <Q  [ <. N ,  1o >. ]  ~Q  } ,  { u  |  [ <. N ,  1o >. ]  ~Q  <Q  u } >.  .P.  <. { l  |  l  <Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  <Q  u } >. ) )
6 recidnq 7194 . . . . . . 7  |-  ( [
<. N ,  1o >. ]  ~Q  e.  Q.  ->  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
)  =  1Q )
71, 6syl 14 . . . . . 6  |-  ( N  e.  N.  ->  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
)  =  1Q )
87breq2d 3936 . . . . 5  |-  ( N  e.  N.  ->  (
l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) )  <->  l  <Q  1Q ) )
98abbidv 2255 . . . 4  |-  ( N  e.  N.  ->  { l  |  l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
) }  =  {
l  |  l  <Q  1Q } )
107breq1d 3934 . . . . 5  |-  ( N  e.  N.  ->  (
( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) )  <Q  u  <->  1Q 
<Q  u ) )
1110abbidv 2255 . . . 4  |-  ( N  e.  N.  ->  { u  |  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) )  <Q  u }  =  {
u  |  1Q  <Q  u } )
129, 11opeq12d 3708 . . 3  |-  ( N  e.  N.  ->  <. { l  |  l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
) } ,  {
u  |  ( [
<. N ,  1o >. ]  ~Q  .Q  ( *Q
`  [ <. N ,  1o >. ]  ~Q  )
)  <Q  u } >.  = 
<. { l  |  l 
<Q  1Q } ,  {
u  |  1Q  <Q  u } >. )
13 df-i1p 7268 . . 3  |-  1P  =  <. { l  |  l 
<Q  1Q } ,  {
u  |  1Q  <Q  u } >.
1412, 13syl6eqr 2188 . 2  |-  ( N  e.  N.  ->  <. { l  |  l  <Q  ( [ <. N ,  1o >. ]  ~Q  .Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  )
) } ,  {
u  |  ( [
<. N ,  1o >. ]  ~Q  .Q  ( *Q
`  [ <. N ,  1o >. ]  ~Q  )
)  <Q  u } >.  =  1P )
155, 14eqtr3d 2172 1  |-  ( N  e.  N.  ->  ( <. { l  |  l 
<Q  [ <. N ,  1o >. ]  ~Q  } ,  { u  |  [ <. N ,  1o >. ]  ~Q  <Q  u } >.  .P.  <. { l  |  l  <Q  ( *Q `  [ <. N ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. N ,  1o >. ]  ~Q  )  <Q  u } >. )  =  1P )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331    e. wcel 1480   {cab 2123   <.cop 3525   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   1oc1o 6299   [cec 6420   N.cnpi 7073    ~Q ceq 7080   Q.cnq 7081   1Qc1q 7082    .Q cmq 7084   *Qcrq 7085    <Q cltq 7086   1Pc1p 7093    .P. cmp 7095
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-2o 6307  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-enq0 7225  df-nq0 7226  df-0nq0 7227  df-plq0 7228  df-mq0 7229  df-inp 7267  df-i1p 7268  df-imp 7270
This theorem is referenced by:  recidpirq  7659
  Copyright terms: Public domain W3C validator