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

Theorem xrnegcon1d 12008
Description: Contraposition law for extended real unary minus. (Contributed by Jim Kingdon, 2-May-2023.)
Hypotheses
Ref Expression
xrnegcon1d.a  |-  ( ph  ->  A  e.  RR* )
xrnegcon1d.b  |-  ( ph  ->  B  e.  RR* )
Assertion
Ref Expression
xrnegcon1d  |-  ( ph  ->  (  -e A  =  B  <->  -e B  =  A ) )

Proof of Theorem xrnegcon1d
StepHypRef Expression
1 xrnegcon1d.b . . . 4  |-  ( ph  ->  B  e.  RR* )
2 xnegneg 10214 . . . . 5  |-  ( B  e.  RR*  ->  -e  -e B  =  B )
32eqeq2d 2250 . . . 4  |-  ( B  e.  RR*  ->  (  -e A  =  -e  -e B  <->  -e A  =  B ) )
41, 3syl 14 . . 3  |-  ( ph  ->  (  -e A  =  -e  -e B  <->  -e A  =  B ) )
5 xrnegcon1d.a . . . 4  |-  ( ph  ->  A  e.  RR* )
61xnegcld 10236 . . . 4  |-  ( ph  -> 
-e B  e. 
RR* )
7 xneg11 10215 . . . 4  |-  ( ( A  e.  RR*  /\  -e
B  e.  RR* )  ->  (  -e A  =  -e  -e B  <->  A  =  -e
B ) )
85, 6, 7syl2anc 415 . . 3  |-  ( ph  ->  (  -e A  =  -e  -e B  <->  A  =  -e
B ) )
94, 8bitr3d 190 . 2  |-  ( ph  ->  (  -e A  =  B  <->  A  =  -e B ) )
10 eqcom 2240 . 2  |-  ( A  =  -e B  <->  -e B  =  A )
119, 10bitrdi 196 1  |-  ( ph  ->  (  -e A  =  B  <->  -e B  =  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   RR*cxr 8349    -ecxne 10150
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280
This theorem depends on definitions:  df-bi 117  df-3or 1010  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-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-sub 8489  df-neg 8490  df-xneg 10153
This theorem is referenced by:  xrminmax  12009  xrmineqinf  12013
  Copyright terms: Public domain W3C validator