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

Theorem eqord2 8723
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 8433 . . 3  |-  ( x  =  y  ->  -u A  =  -u B )
3 ltord.2 . . . 4  |-  ( x  =  C  ->  A  =  M )
43negeqd 8433 . . 3  |-  ( x  =  C  ->  -u A  =  -u M )
5 ltord.3 . . . 4  |-  ( x  =  D  ->  A  =  N )
65negeqd 8433 . . 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 8618 . . 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 2606 . . . . . . 7  |-  ( ph  ->  A. x  e.  S  A  e.  RR )
121eleq1d 2300 . . . . . . . 8  |-  ( x  =  y  ->  ( A  e.  RR  <->  B  e.  RR ) )
1312rspccva 2910 . . . . . . 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 8701 . . . . 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 8722 . 2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <->  -u M  =  -u N
) )
213eleq1d 2300 . . . . . . 7  |-  ( x  =  C  ->  ( A  e.  RR  <->  M  e.  RR ) )
2221rspccva 2910 . . . . . 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 8267 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  M  e.  CC )
265eleq1d 2300 . . . . . . 7  |-  ( x  =  D  ->  ( A  e.  RR  <->  N  e.  RR ) )
2726rspccva 2910 . . . . . 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 8267 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  N  e.  CC )
3125, 30neg11ad 8545 . 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 1398    e. wcel 2202   A.wral 2511    C_ wss 3201   class class class wbr 4093   RRcr 8091    < clt 8273   -ucneg 8410
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-apti 8207  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-sub 8411  df-neg 8412
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator