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

Theorem caucvgrelemrec 11619
Description: Two ways to express a reciprocal. (Contributed by Jim Kingdon, 20-Jul-2021.)
Assertion
Ref Expression
caucvgrelemrec  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( iota_ r  e.  RR  ( A  x.  r )  =  1 )  =  ( 1  /  A
) )
Distinct variable group:    A, r

Proof of Theorem caucvgrelemrec
StepHypRef Expression
1 rerecclap 8969 . 2  |-  ( ( A  e.  RR  /\  A #  0 )  ->  (
1  /  A )  e.  RR )
2 simpr 110 . . . . 5  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  r  e.  RR )
32recnd 8267 . . . 4  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  r  e.  CC )
4 simpll 527 . . . . 5  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  A  e.  RR )
54recnd 8267 . . . 4  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  A  e.  CC )
6 simplr 529 . . . 4  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  A #  0 )
7 ax-1cn 8185 . . . . 5  |-  1  e.  CC
8 divmulap 8914 . . . . 5  |-  ( ( 1  e.  CC  /\  r  e.  CC  /\  ( A  e.  CC  /\  A #  0 ) )  -> 
( ( 1  /  A )  =  r  <-> 
( A  x.  r
)  =  1 ) )
97, 8mp3an1 1361 . . . 4  |-  ( ( r  e.  CC  /\  ( A  e.  CC  /\  A #  0 ) )  ->  ( ( 1  /  A )  =  r  <->  ( A  x.  r )  =  1 ) )
103, 5, 6, 9syl12anc 1272 . . 3  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  ( ( 1  /  A )  =  r  <-> 
( A  x.  r
)  =  1 ) )
11 eqcom 2233 . . 3  |-  ( ( 1  /  A )  =  r  <->  r  =  ( 1  /  A
) )
1210, 11bitr3di 195 . 2  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  r  e.  RR )  ->  ( ( A  x.  r )  =  1  <-> 
r  =  ( 1  /  A ) ) )
131, 12riota5 6009 1  |-  ( ( A  e.  RR  /\  A #  0 )  ->  ( iota_ r  e.  RR  ( A  x.  r )  =  1 )  =  ( 1  /  A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   class class class wbr 4093   iota_crio 5980  (class class class)co 6028   CCcc 8090   RRcr 8091   0cc0 8092   1c1 8093    x. cmul 8097   # cap 8820    / cdiv 8911
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912
This theorem is referenced by:  caucvgrelemcau  11620
  Copyright terms: Public domain W3C validator