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

Theorem leisorel 11019
Description: Version of isorel 5900 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 1000 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  F  Isom  <  ,  <  ( A ,  B )
)
2 simp3r 1029 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  D  e.  A )
3 simp3l 1028 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  C  e.  A )
4 isorel 5900 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( D  e.  A  /\  C  e.  A ) )  -> 
( D  <  C  <->  ( F `  D )  <  ( F `  C ) ) )
54notbid 669 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( D  e.  A  /\  C  e.  A ) )  -> 
( -.  D  < 
C  <->  -.  ( F `  D )  <  ( F `  C )
) )
61, 2, 3, 5syl12anc 1248 . 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 1026 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  A  C_ 
RR* )
87, 3sseldd 3202 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  C  e.  RR* )
97, 2sseldd 3202 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  D  e.  RR* )
10 xrlenlt 8172 . . 3  |-  ( ( C  e.  RR*  /\  D  e.  RR* )  ->  ( C  <_  D  <->  -.  D  <  C ) )
118, 9, 10syl2anc 411 . 2  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( C  <_  D  <->  -.  D  <  C ) )
12 simp2r 1027 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  B  C_ 
RR* )
13 isof1o 5899 . . . . . 6  |-  ( F 
Isom  <  ,  <  ( A ,  B )  ->  F : A -1-1-onto-> B )
14 f1of 5544 . . . . . 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, 3ffvelcdmd 5739 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  C )  e.  B )
1712, 16sseldd 3202 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  C )  e.  RR* )
1815, 2ffvelcdmd 5739 . . . 4  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  D )  e.  B )
1912, 18sseldd 3202 . . 3  |-  ( ( F  Isom  <  ,  <  ( A ,  B )  /\  ( A  C_  RR* 
/\  B  C_  RR* )  /\  ( C  e.  A  /\  D  e.  A
) )  ->  ( F `  D )  e.  RR* )
20 xrlenlt 8172 . . 3  |-  ( ( ( F `  C
)  e.  RR*  /\  ( F `  D )  e.  RR* )  ->  (
( F `  C
)  <_  ( F `  D )  <->  -.  ( F `  D )  <  ( F `  C
) ) )
2117, 19, 20syl2anc 411 . 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 220 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 104    <-> wb 105    /\ w3a 981    e. wcel 2178    C_ wss 3174   class class class wbr 4059   -->wf 5286   -1-1-onto->wf1o 5289   ` cfv 5290    Isom wiso 5291   RR*cxr 8141    < clt 8142    <_ cle 8143
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-f1o 5297  df-fv 5298  df-isom 5299  df-le 8148
This theorem is referenced by:  seq3coll  11024  summodclem2a  11807  prodmodclem2a  12002
  Copyright terms: Public domain W3C validator