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

Theorem receuap 8437
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 8421 . . . 4  |-  ( ( B  e.  CC  /\  B #  0 )  ->  E. y  e.  CC  ( B  x.  y )  =  1 )
213adant1 999 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  B #  0 )  ->  E. y  e.  CC  ( B  x.  y )  =  1 )
3 simprl 520 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
y  e.  CC )
4 simpll 518 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  A  e.  CC )
53, 4mulcld 7793 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( y  x.  A
)  e.  CC )
6 oveq1 5781 . . . . . . . 8  |-  ( ( B  x.  y )  =  1  ->  (
( B  x.  y
)  x.  A )  =  ( 1  x.  A ) )
76ad2antll 482 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( ( B  x.  y )  x.  A
)  =  ( 1  x.  A ) )
8 simplr 519 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  B  e.  CC )
98, 3, 4mulassd 7796 . . . . . . 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 7791 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( 1  x.  A
)  =  A )
117, 9, 103eqtr3d 2180 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  -> 
( B  x.  (
y  x.  A ) )  =  A )
12 oveq2 5782 . . . . . . . 8  |-  ( x  =  ( y  x.  A )  ->  ( B  x.  x )  =  ( B  x.  ( y  x.  A
) ) )
1312eqeq1d 2148 . . . . . . 7  |-  ( x  =  ( y  x.  A )  ->  (
( B  x.  x
)  =  A  <->  ( B  x.  ( y  x.  A
) )  =  A ) )
1413rspcev 2789 . . . . . 6  |-  ( ( ( y  x.  A
)  e.  CC  /\  ( B  x.  (
y  x.  A ) )  =  A )  ->  E. x  e.  CC  ( B  x.  x
)  =  A )
155, 11, 14syl2anc 408 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( y  e.  CC  /\  ( B  x.  y )  =  1 ) )  ->  E. x  e.  CC  ( B  x.  x
)  =  A )
1615rexlimdvaa 2550 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( E. y  e.  CC  ( B  x.  y )  =  1  ->  E. x  e.  CC  ( B  x.  x
)  =  A ) )
17163adant3 1001 . . 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 2159 . . . . . . 7  |-  ( ( ( B  x.  x
)  =  A  /\  ( B  x.  y
)  =  A )  ->  ( B  x.  x )  =  ( B  x.  y ) )
20 mulcanap 8433 . . . . . . 7  |-  ( ( x  e.  CC  /\  y  e.  CC  /\  ( B  e.  CC  /\  B #  0 ) )  -> 
( ( B  x.  x )  =  ( B  x.  y )  <-> 
x  =  y ) )
2119, 20syl5ib 153 . . . . . 6  |-  ( ( x  e.  CC  /\  y  e.  CC  /\  ( B  e.  CC  /\  B #  0 ) )  -> 
( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) )
22213expa 1181 . . . . 5  |-  ( ( ( x  e.  CC  /\  y  e.  CC )  /\  ( B  e.  CC  /\  B #  0 ) )  ->  (
( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) )
2322expcom 115 . . . 4  |-  ( ( B  e.  CC  /\  B #  0 )  ->  (
( x  e.  CC  /\  y  e.  CC )  ->  ( ( ( B  x.  x )  =  A  /\  ( B  x.  y )  =  A )  ->  x  =  y ) ) )
24233adant1 999 . . 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 2513 . 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 5782 . . . 4  |-  ( x  =  y  ->  ( B  x.  x )  =  ( B  x.  y ) )
2726eqeq1d 2148 . . 3  |-  ( x  =  y  ->  (
( B  x.  x
)  =  A  <->  ( B  x.  y )  =  A ) )
2827reu4 2878 . 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 413 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 103    /\ w3a 962    = wceq 1331    e. wcel 1480   A.wral 2416   E.wrex 2417   E!wreu 2418   class class class wbr 3929  (class class class)co 5774   CCcc 7625   0cc0 7627   1c1 7628    x. cmul 7632   # cap 8350
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 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7718  ax-resscn 7719  ax-1cn 7720  ax-1re 7721  ax-icn 7722  ax-addcl 7723  ax-addrcl 7724  ax-mulcl 7725  ax-mulrcl 7726  ax-addcom 7727  ax-mulcom 7728  ax-addass 7729  ax-mulass 7730  ax-distr 7731  ax-i2m1 7732  ax-0lt1 7733  ax-1rid 7734  ax-0id 7735  ax-rnegex 7736  ax-precex 7737  ax-cnre 7738  ax-pre-ltirr 7739  ax-pre-ltwlin 7740  ax-pre-lttrn 7741  ax-pre-apti 7742  ax-pre-ltadd 7743  ax-pre-mulgt0 7744  ax-pre-mulext 7745
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-po 4218  df-iso 4219  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-pnf 7809  df-mnf 7810  df-xr 7811  df-ltxr 7812  df-le 7813  df-sub 7942  df-neg 7943  df-reap 8344  df-ap 8351
This theorem is referenced by:  divvalap  8441  divmulap  8442  divclap  8445
  Copyright terms: Public domain W3C validator