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

Theorem eqord2 8559
Description: A strictly decreasing real function on a subset of  RR is one-to-one. (Contributed by Mario Carneiro, 14-Jun-2014.)
Hypotheses
Ref Expression
ltord.1  |-  ( x  =  y  ->  A  =  B )
ltord.2  |-  ( x  =  C  ->  A  =  M )
ltord.3  |-  ( x  =  D  ->  A  =  N )
ltord.4  |-  S  C_  RR
ltord.5  |-  ( (
ph  /\  x  e.  S )  ->  A  e.  RR )
ltord2.6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  B  <  A ) )
Assertion
Ref Expression
eqord2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <-> 
M  =  N ) )
Distinct variable groups:    x, B    x, y, C    x, D, y   
x, M, y    x, N, y    ph, x, y   
x, S, y
Allowed substitution hints:    A( x, y)    B( y)

Proof of Theorem eqord2
StepHypRef Expression
1 ltord.1 . . . 4  |-  ( x  =  y  ->  A  =  B )
21negeqd 8269 . . 3  |-  ( x  =  y  ->  -u A  =  -u B )
3 ltord.2 . . . 4  |-  ( x  =  C  ->  A  =  M )
43negeqd 8269 . . 3  |-  ( x  =  C  ->  -u A  =  -u M )
5 ltord.3 . . . 4  |-  ( x  =  D  ->  A  =  N )
65negeqd 8269 . . 3  |-  ( x  =  D  ->  -u A  =  -u N )
7 ltord.4 . . 3  |-  S  C_  RR
8 ltord.5 . . . 4  |-  ( (
ph  /\  x  e.  S )  ->  A  e.  RR )
98renegcld 8454 . . 3  |-  ( (
ph  /\  x  e.  S )  ->  -u A  e.  RR )
10 ltord2.6 . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  B  <  A ) )
118ralrimiva 2579 . . . . . . 7  |-  ( ph  ->  A. x  e.  S  A  e.  RR )
121eleq1d 2274 . . . . . . . 8  |-  ( x  =  y  ->  ( A  e.  RR  <->  B  e.  RR ) )
1312rspccva 2876 . . . . . . 7  |-  ( ( A. x  e.  S  A  e.  RR  /\  y  e.  S )  ->  B  e.  RR )
1411, 13sylan 283 . . . . . 6  |-  ( (
ph  /\  y  e.  S )  ->  B  e.  RR )
1514adantrl 478 . . . . 5  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  ->  B  e.  RR )
168adantrr 479 . . . . 5  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  ->  A  e.  RR )
17 ltneg 8537 . . . . 5  |-  ( ( B  e.  RR  /\  A  e.  RR )  ->  ( B  <  A  <->  -u A  <  -u B
) )
1815, 16, 17syl2anc 411 . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( B  <  A  <->  -u A  <  -u B
) )
1910, 18sylibd 149 . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  -> 
-u A  <  -u B
) )
202, 4, 6, 7, 9, 19eqord1 8558 . 2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <->  -u M  =  -u N
) )
213eleq1d 2274 . . . . . . 7  |-  ( x  =  C  ->  ( A  e.  RR  <->  M  e.  RR ) )
2221rspccva 2876 . . . . . 6  |-  ( ( A. x  e.  S  A  e.  RR  /\  C  e.  S )  ->  M  e.  RR )
2311, 22sylan 283 . . . . 5  |-  ( (
ph  /\  C  e.  S )  ->  M  e.  RR )
2423adantrr 479 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  M  e.  RR )
2524recnd 8103 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  M  e.  CC )
265eleq1d 2274 . . . . . . 7  |-  ( x  =  D  ->  ( A  e.  RR  <->  N  e.  RR ) )
2726rspccva 2876 . . . . . 6  |-  ( ( A. x  e.  S  A  e.  RR  /\  D  e.  S )  ->  N  e.  RR )
2811, 27sylan 283 . . . . 5  |-  ( (
ph  /\  D  e.  S )  ->  N  e.  RR )
2928adantrl 478 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  N  e.  RR )
3029recnd 8103 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  N  e.  CC )
3125, 30neg11ad 8381 . 2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( -u M  =  -u N 
<->  M  =  N ) )
3220, 31bitrd 188 1  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <-> 
M  =  N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2176   A.wral 2484    C_ wss 3166   class class class wbr 4045   RRcr 7926    < clt 8109   -ucneg 8246
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-pow 4219  ax-pr 4254  ax-un 4481  ax-setind 4586  ax-cnex 8018  ax-resscn 8019  ax-1cn 8020  ax-1re 8021  ax-icn 8022  ax-addcl 8023  ax-addrcl 8024  ax-mulcl 8025  ax-addcom 8027  ax-addass 8029  ax-distr 8031  ax-i2m1 8032  ax-0id 8035  ax-rnegex 8036  ax-cnre 8038  ax-pre-ltirr 8039  ax-pre-apti 8042  ax-pre-ltadd 8043
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-opab 4107  df-id 4341  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-iota 5233  df-fun 5274  df-fv 5280  df-riota 5901  df-ov 5949  df-oprab 5950  df-mpo 5951  df-pnf 8111  df-mnf 8112  df-ltxr 8114  df-sub 8247  df-neg 8248
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator