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

Theorem receuap 8655
Description: Existential uniqueness of reciprocals. (Contributed by Jim Kingdon, 21-Feb-2020.)
Assertion
Ref Expression
receuap  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  E! x  e.  CC  ( B  x.  x )  =  A )
Distinct variable groups:    x, A    x, B

Proof of Theorem receuap
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 recexap 8639 . . . 4  |-  ( ( B  e.  CC  /\  B #  0 )  ->  E. y  e.  CC  ( B  x.  y )  =  1 )
213adant1 1017 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  E. y  e.  CC  ( B  x.  y )  =  1 )
3 simprl 529 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
y  e.  CC )
4 simpll 527 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  A  e.  CC )
53, 4mulcld 8007 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( y  x.  A
)  e.  CC )
6 oveq1 5902 . . . . . . . 8  |-  ( ( B  x.  y )  =  1  ->  (
( B  x.  y
)  x.  A )  =  ( 1  x.  A ) )
76ad2antll 491 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( ( B  x.  y )  x.  A
)  =  ( 1  x.  A ) )
8 simplr 528 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  B  e.  CC )
98, 3, 4mulassd 8010 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( ( B  x.  y )  x.  A
)  =  ( B  x.  ( y  x.  A ) ) )
104mulid2d 8005 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( 1  x.  A
)  =  A )
117, 9, 103eqtr3d 2230 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( B  x.  (
y  x.  A ) )  =  A )
12 oveq2 5903 . . . . . . . 8  |-  ( x  =  ( y  x.  A )  ->  ( B  x.  x )  =  ( B  x.  ( y  x.  A
) ) )
1312eqeq1d 2198 . . . . . . 7  |-  ( x  =  ( y  x.  A )  ->  (
( B  x.  x
)  =  A  <->  ( B  x.  ( y  x.  A
) )  =  A ) )
1413rspcev 2856 . . . . . 6  |-  ( ( ( y  x.  A
)  e.  CC  /\  ( B  x.  (
y  x.  A ) )  =  A )  ->  E. x  e.  CC  ( B  x.  x
)  =  A )
155, 11, 14syl2anc 411 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  E. x  e.  CC  ( B  x.  x
)  =  A )
1615rexlimdvaa 2608 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( E. y  e.  CC  ( B  x.  y )  =  1  ->  E. x  e.  CC  ( B  x.  x
)  =  A ) )
17163adant3 1019 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  ( E. y  e.  CC  ( B  x.  y
)  =  1  ->  E. x  e.  CC  ( B  x.  x
)  =  A ) )
182, 17mpd 13 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  E. x  e.  CC  ( B  x.  x )  =  A )
19 eqtr3 2209 . . . . . . 7  |-  ( ( ( B  x.  x
)  =  A  /\  ( B  x.  y
)  =  A )  ->  ( B  x.  x )  =  ( B  x.  y ) )
20 mulcanap 8651 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC  /\  ( B  e.  CC  /\  B #  0 ) )  -> 
( ( B  x.  x )  =  ( B  x.  y )  <-> 
x  =  y ) )
2119, 20imbitrid 154 . . . . . 6  |-  ( ( x  e.  CC  /\  y  e.  CC  /\  ( B  e.  CC  /\  B #  0 ) )  -> 
( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) )
22213expa 1205 . . . . 5  |-  ( ( ( x  e.  CC  /\  y  e.  CC )  /\  ( B  e.  CC  /\  B #  0 ) )  ->  (
( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) )
2322expcom 116 . . . 4  |-  ( ( B  e.  CC  /\  B #  0 )  ->  (
( x  e.  CC  /\  y  e.  CC )  ->  ( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) ) )
24233adant1 1017 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  (
( x  e.  CC  /\  y  e.  CC )  ->  ( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) ) )
2524ralrimivv 2571 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  A. x  e.  CC  A. y  e.  CC  ( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) )
26 oveq2 5903 . . . 4  |-  ( x  =  y  ->  ( B  x.  x )  =  ( B  x.  y ) )
2726eqeq1d 2198 . . 3  |-  ( x  =  y  ->  (
( B  x.  x
)  =  A  <->  ( B  x.  y )  =  A ) )
2827reu4 2946 . 2  |-  ( E! x  e.  CC  ( B  x.  x )  =  A  <->  ( E. x  e.  CC  ( B  x.  x )  =  A  /\  A. x  e.  CC  A. y  e.  CC  ( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) ) )
2918, 25, 28sylanbrc 417 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  E! x  e.  CC  ( B  x.  x )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364    e. wcel 2160   A.wral 2468   E.wrex 2469   E!wreu 2470   class class class wbr 4018  (class class class)co 5895   CCcc 7838   0cc0 7840   1c1 7841    x. cmul 7845   # cap 8567
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-cnex 7931  ax-resscn 7932  ax-1cn 7933  ax-1re 7934  ax-icn 7935  ax-addcl 7936  ax-addrcl 7937  ax-mulcl 7938  ax-mulrcl 7939  ax-addcom 7940  ax-mulcom 7941  ax-addass 7942  ax-mulass 7943  ax-distr 7944  ax-i2m1 7945  ax-0lt1 7946  ax-1rid 7947  ax-0id 7948  ax-rnegex 7949  ax-precex 7950  ax-cnre 7951  ax-pre-ltirr 7952  ax-pre-ltwlin 7953  ax-pre-lttrn 7954  ax-pre-apti 7955  ax-pre-ltadd 7956  ax-pre-mulgt0 7957  ax-pre-mulext 7958
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-id 4311  df-po 4314  df-iso 4315  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-iota 5196  df-fun 5237  df-fv 5243  df-riota 5851  df-ov 5898  df-oprab 5899  df-mpo 5900  df-pnf 8023  df-mnf 8024  df-xr 8025  df-ltxr 8026  df-le 8027  df-sub 8159  df-neg 8160  df-reap 8561  df-ap 8568
This theorem is referenced by:  divvalap  8660  divmulap  8661  divclap  8664
  Copyright terms: Public domain W3C validator