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

Theorem recvguniqlem 11760
Description: Lemma for recvguniq 11761. Some of the rearrangements of the expressions. (Contributed by Jim Kingdon, 8-Aug-2021.)
Hypotheses
Ref Expression
recvguniqlem.f  |-  ( ph  ->  F : NN --> RR )
recvguniqlem.a  |-  ( ph  ->  A  e.  RR )
recvguniqlem.b  |-  ( ph  ->  B  e.  RR )
recvguniqlem.k  |-  ( ph  ->  K  e.  NN )
recvguniqlem.lt1  |-  ( ph  ->  A  <  ( ( F `  K )  +  ( ( A  -  B )  / 
2 ) ) )
recvguniqlem.lt2  |-  ( ph  ->  ( F `  K
)  <  ( B  +  ( ( A  -  B )  / 
2 ) ) )
Assertion
Ref Expression
recvguniqlem  |-  ( ph  -> F.  )

Proof of Theorem recvguniqlem
StepHypRef Expression
1 recvguniqlem.a . . 3  |-  ( ph  ->  A  e.  RR )
2 recvguniqlem.f . . . . 5  |-  ( ph  ->  F : NN --> RR )
3 recvguniqlem.k . . . . 5  |-  ( ph  ->  K  e.  NN )
42, 3ffvelcdmd 5844 . . . 4  |-  ( ph  ->  ( F `  K
)  e.  RR )
5 recvguniqlem.b . . . . . 6  |-  ( ph  ->  B  e.  RR )
61, 5resubcld 8708 . . . . 5  |-  ( ph  ->  ( A  -  B
)  e.  RR )
76rehalfcld 9552 . . . 4  |-  ( ph  ->  ( ( A  -  B )  /  2
)  e.  RR )
84, 7readdcld 8355 . . 3  |-  ( ph  ->  ( ( F `  K )  +  ( ( A  -  B
)  /  2 ) )  e.  RR )
9 recvguniqlem.lt1 . . 3  |-  ( ph  ->  A  <  ( ( F `  K )  +  ( ( A  -  B )  / 
2 ) ) )
105, 7readdcld 8355 . . . . 5  |-  ( ph  ->  ( B  +  ( ( A  -  B
)  /  2 ) )  e.  RR )
11 recvguniqlem.lt2 . . . . 5  |-  ( ph  ->  ( F `  K
)  <  ( B  +  ( ( A  -  B )  / 
2 ) ) )
124, 10, 7, 11ltadd1dd 8884 . . . 4  |-  ( ph  ->  ( ( F `  K )  +  ( ( A  -  B
)  /  2 ) )  <  ( ( B  +  ( ( A  -  B )  /  2 ) )  +  ( ( A  -  B )  / 
2 ) ) )
135recnd 8354 . . . . . 6  |-  ( ph  ->  B  e.  CC )
147recnd 8354 . . . . . 6  |-  ( ph  ->  ( ( A  -  B )  /  2
)  e.  CC )
1513, 14, 14addassd 8348 . . . . 5  |-  ( ph  ->  ( ( B  +  ( ( A  -  B )  /  2
) )  +  ( ( A  -  B
)  /  2 ) )  =  ( B  +  ( ( ( A  -  B )  /  2 )  +  ( ( A  -  B )  /  2
) ) ) )
166recnd 8354 . . . . . . 7  |-  ( ph  ->  ( A  -  B
)  e.  CC )
17162halvesd 9551 . . . . . 6  |-  ( ph  ->  ( ( ( A  -  B )  / 
2 )  +  ( ( A  -  B
)  /  2 ) )  =  ( A  -  B ) )
1817oveq2d 6101 . . . . 5  |-  ( ph  ->  ( B  +  ( ( ( A  -  B )  /  2
)  +  ( ( A  -  B )  /  2 ) ) )  =  ( B  +  ( A  -  B ) ) )
191recnd 8354 . . . . . 6  |-  ( ph  ->  A  e.  CC )
2013, 19pncan3d 8640 . . . . 5  |-  ( ph  ->  ( B  +  ( A  -  B ) )  =  A )
2115, 18, 203eqtrd 2275 . . . 4  |-  ( ph  ->  ( ( B  +  ( ( A  -  B )  /  2
) )  +  ( ( A  -  B
)  /  2 ) )  =  A )
2212, 21breqtrd 4156 . . 3  |-  ( ph  ->  ( ( F `  K )  +  ( ( A  -  B
)  /  2 ) )  <  A )
231, 8, 1, 9, 22lttrd 8452 . 2  |-  ( ph  ->  A  <  A )
241ltnrd 8437 . 2  |-  ( ph  ->  -.  A  <  A
)
2523, 24pm2.21fal 1422 1  |-  ( ph  -> F.  )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4   F. wfal 1407    e. wcel 2209   class class class wbr 4130   -->wf 5373   ` cfv 5377  (class class class)co 6085   RRcr 8178    + caddc 8182    < clt 8360    - cmin 8497    / cdiv 9002   NNcn 9304   2c2 9355
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-2 9363
This theorem is used by:  recvguniq  11761
  Copyright terms: Public domain W3C validator