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

Theorem negiso 9138
Description: Negation is an order anti-isomorphism of the real numbers, which is its own inverse. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
negiso.1  |-  F  =  ( x  e.  RR  |->  -u x )
Assertion
Ref Expression
negiso  |-  ( F 
Isom  <  ,  `'  <  ( RR ,  RR )  /\  `' F  =  F )

Proof of Theorem negiso
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 negiso.1 . . . . . 6  |-  F  =  ( x  e.  RR  |->  -u x )
2 simpr 110 . . . . . . 7  |-  ( ( T.  /\  x  e.  RR )  ->  x  e.  RR )
32renegcld 8562 . . . . . 6  |-  ( ( T.  /\  x  e.  RR )  ->  -u x  e.  RR )
4 simpr 110 . . . . . . 7  |-  ( ( T.  /\  y  e.  RR )  ->  y  e.  RR )
54renegcld 8562 . . . . . 6  |-  ( ( T.  /\  y  e.  RR )  ->  -u y  e.  RR )
6 recn 8168 . . . . . . . 8  |-  ( x  e.  RR  ->  x  e.  CC )
7 recn 8168 . . . . . . . 8  |-  ( y  e.  RR  ->  y  e.  CC )
8 negcon2 8435 . . . . . . . 8  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( x  =  -u y 
<->  y  =  -u x
) )
96, 7, 8syl2an 289 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( x  =  -u y 
<->  y  =  -u x
) )
109adantl 277 . . . . . 6  |-  ( ( T.  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( x  =  -u y 
<->  y  =  -u x
) )
111, 3, 5, 10f1ocnv2d 6230 . . . . 5  |-  ( T. 
->  ( F : RR -1-1-onto-> RR  /\  `' F  =  (
y  e.  RR  |->  -u y ) ) )
1211mptru 1406 . . . 4  |-  ( F : RR -1-1-onto-> RR  /\  `' F  =  ( y  e.  RR  |->  -u y ) )
1312simpli 111 . . 3  |-  F : RR
-1-1-onto-> RR
14 simpl 109 . . . . . . . 8  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  z  e.  RR )
1514recnd 8211 . . . . . . 7  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  z  e.  CC )
1615negcld 8480 . . . . . 6  |-  ( ( z  e.  RR  /\  y  e.  RR )  -> 
-u z  e.  CC )
177adantl 277 . . . . . . 7  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  y  e.  CC )
1817negcld 8480 . . . . . 6  |-  ( ( z  e.  RR  /\  y  e.  RR )  -> 
-u y  e.  CC )
19 brcnvg 4911 . . . . . 6  |-  ( (
-u z  e.  CC  /\  -u y  e.  CC )  ->  ( -u z `'  <  -u y  <->  -u y  <  -u z ) )
2016, 18, 19syl2anc 411 . . . . 5  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( -u z `'  <  -u y  <->  -u y  <  -u z ) )
211a1i 9 . . . . . . 7  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  F  =  ( x  e.  RR  |->  -u x
) )
22 negeq 8375 . . . . . . . 8  |-  ( x  =  z  ->  -u x  =  -u z )
2322adantl 277 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  y  e.  RR )  /\  x  =  z )  ->  -u x  = 
-u z )
2421, 23, 14, 16fvmptd 5728 . . . . . 6  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( F `  z
)  =  -u z
)
25 negeq 8375 . . . . . . . 8  |-  ( x  =  y  ->  -u x  =  -u y )
2625adantl 277 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  y  e.  RR )  /\  x  =  y )  ->  -u x  = 
-u y )
27 simpr 110 . . . . . . 7  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  y  e.  RR )
2821, 26, 27, 18fvmptd 5728 . . . . . 6  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( F `  y
)  =  -u y
)
2924, 28breq12d 4101 . . . . 5  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( ( F `  z ) `'  <  ( F `  y )  <->  -u z `'  <  -u y
) )
30 ltneg 8645 . . . . 5  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( z  <  y  <->  -u y  <  -u z
) )
3120, 29, 303bitr4rd 221 . . . 4  |-  ( ( z  e.  RR  /\  y  e.  RR )  ->  ( z  <  y  <->  ( F `  z ) `'  <  ( F `  y ) ) )
3231rgen2a 2586 . . 3  |-  A. z  e.  RR  A. y  e.  RR  ( z  < 
y  <->  ( F `  z ) `'  <  ( F `  y ) )
33 df-isom 5335 . . 3  |-  ( F 
Isom  <  ,  `'  <  ( RR ,  RR )  <-> 
( F : RR -1-1-onto-> RR  /\ 
A. z  e.  RR  A. y  e.  RR  (
z  <  y  <->  ( F `  z ) `'  <  ( F `  y ) ) ) )
3413, 32, 33mpbir2an 950 . 2  |-  F  Isom  <  ,  `'  <  ( RR ,  RR )
35 negeq 8375 . . . 4  |-  ( y  =  x  ->  -u y  =  -u x )
3635cbvmptv 4185 . . 3  |-  ( y  e.  RR  |->  -u y
)  =  ( x  e.  RR  |->  -u x
)
3712simpri 113 . . 3  |-  `' F  =  ( y  e.  RR  |->  -u y )
3836, 37, 13eqtr4i 2262 . 2  |-  `' F  =  F
3934, 38pm3.2i 272 1  |-  ( F 
Isom  <  ,  `'  <  ( RR ,  RR )  /\  `' F  =  F )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1397   T. wtru 1398    e. wcel 2202   A.wral 2510   class class class wbr 4088    |-> cmpt 4150   `'ccnv 4724   -1-1-onto->wf1o 5325   ` cfv 5326    Isom wiso 5327   CCcc 8033   RRcr 8034    < clt 8217   -ucneg 8354
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8126  ax-resscn 8127  ax-1cn 8128  ax-1re 8129  ax-icn 8130  ax-addcl 8131  ax-addrcl 8132  ax-mulcl 8133  ax-addcom 8135  ax-addass 8137  ax-distr 8139  ax-i2m1 8140  ax-0id 8143  ax-rnegex 8144  ax-cnre 8146  ax-pre-ltadd 8151
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5974  df-ov 6024  df-oprab 6025  df-mpo 6026  df-pnf 8219  df-mnf 8220  df-ltxr 8222  df-sub 8355  df-neg 8356
This theorem is referenced by:  infrenegsupex  9831
  Copyright terms: Public domain W3C validator