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

Theorem leisorel 10759
Description: Version of isorel 5784 for strictly increasing functions on the reals. (Contributed by Mario Carneiro, 6-Apr-2015.) (Revised by Mario Carneiro, 9-Sep-2015.)
Assertion
Ref Expression
leisorel  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( C  <_  D  <->  ( F `  C )  <_  ( F `  D )
) )

Proof of Theorem leisorel
StepHypRef Expression
1 simp1 992 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  F  Isom  <  ,  <  ( A ,  B )
)
2 simp3r 1021 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  D  e.  A )
3 simp3l 1020 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  C  e.  A )
4 isorel 5784 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( D  e.  A  /\  C  e.  A ) )  -> 
( D  <  C  <->  ( F `  D )  <  ( F `  C ) ) )
54notbid 662 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( D  e.  A  /\  C  e.  A ) )  -> 
( -.  D  < 
C  <->  -.  ( F `  D )  <  ( F `  C )
) )
61, 2, 3, 5syl12anc 1231 . 2  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( -.  D  <  C  <->  -.  ( F `  D )  <  ( F `  C
) ) )
7 simp2l 1018 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  A  C_ 
RR* )
87, 3sseldd 3148 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  C  e.  RR* )
97, 2sseldd 3148 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  D  e.  RR* )
10 xrlenlt 7971 . . 3  |-  ( ( C  e.  RR*  /\  D  e.  RR* )  ->  ( C  <_  D  <->  -.  D  <  C ) )
118, 9, 10syl2anc 409 . 2  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( C  <_  D  <->  -.  D  <  C ) )
12 simp2r 1019 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  B  C_ 
RR* )
13 isof1o 5783 . . . . . 6  |-  ( F 
Isom  <  ,  <  ( A ,  B )  ->  F : A -1-1-onto-> B )
14 f1of 5440 . . . . . 6  |-  ( F : A -1-1-onto-> B  ->  F : A
--> B )
151, 13, 143syl 17 . . . . 5  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  F : A --> B )
1615, 3ffvelrnd 5629 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  C )  e.  B )
1712, 16sseldd 3148 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  C )  e.  RR* )
1815, 2ffvelrnd 5629 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  D )  e.  B )
1912, 18sseldd 3148 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  D )  e.  RR* )
20 xrlenlt 7971 . . 3  |-  ( ( ( F `  C
)  e.  RR*  /\  ( F `  D )  e.  RR* )  ->  (
( F `  C
)  <_  ( F `  D )  <->  -.  ( F `  D )  <  ( F `  C
) ) )
2117, 19, 20syl2anc 409 . 2  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  (
( F `  C
)  <_  ( F `  D )  <->  -.  ( F `  D )  <  ( F `  C
) ) )
226, 11, 213bitr4d 219 1  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( C  <_  D  <->  ( F `  C )  <_  ( F `  D )
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 973    e. wcel 2141    C_ wss 3121   class class class wbr 3987   -->wf 5192   -1-1-onto->wf1o 5195   ` cfv 5196    Isom wiso 5197   RR*cxr 7940    < clt 7941    <_ cle 7942
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4105  ax-pow 4158  ax-pr 4192
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-id 4276  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-rn 4620  df-iota 5158  df-fun 5198  df-fn 5199  df-f 5200  df-f1 5201  df-f1o 5203  df-fv 5204  df-isom 5205  df-le 7947
This theorem is referenced by:  seq3coll  10764  summodclem2a  11331  prodmodclem2a  11526
  Copyright terms: Public domain W3C validator