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

Theorem eqord1 8801
Description: A strictly increasing real function on a subset of  RR is one-to-one. (Contributed by Mario Carneiro, 14-Jun-2014.) (Revised by Jim Kingdon, 20-Dec-2022.)
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 )
ltord.6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  A  <  B ) )
Assertion
Ref Expression
eqord1  |-  ( (
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 eqord1
StepHypRef Expression
1 simprl 535 . . . . . 6  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  C  e.  S )
2 elisset 2836 . . . . . 6  |-  ( C  e.  S  ->  E. x  x  =  C )
31, 2syl 14 . . . . 5  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  E. x  x  =  C )
43adantr 276 . . . 4  |-  ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S )
)  /\  C  =  D )  ->  E. x  x  =  C )
5 ltord.2 . . . . . 6  |-  ( x  =  C  ->  A  =  M )
65adantl 277 . . . . 5  |-  ( ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S
) )  /\  C  =  D )  /\  x  =  C )  ->  A  =  M )
7 eqeq2 2248 . . . . . . . 8  |-  ( C  =  D  ->  (
x  =  C  <->  x  =  D ) )
87adantl 277 . . . . . . 7  |-  ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S )
)  /\  C  =  D )  ->  (
x  =  C  <->  x  =  D ) )
98biimpa 296 . . . . . 6  |-  ( ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S
) )  /\  C  =  D )  /\  x  =  C )  ->  x  =  D )
10 ltord.3 . . . . . 6  |-  ( x  =  D  ->  A  =  N )
119, 10syl 14 . . . . 5  |-  ( ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S
) )  /\  C  =  D )  /\  x  =  C )  ->  A  =  N )
126, 11eqtr3d 2273 . . . 4  |-  ( ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S
) )  /\  C  =  D )  /\  x  =  C )  ->  M  =  N )
134, 12exlimddv 1954 . . 3  |-  ( ( ( ph  /\  ( C  e.  S  /\  D  e.  S )
)  /\  C  =  D )  ->  M  =  N )
1413ex 115 . 2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  ->  M  =  N ) )
15 ltord.1 . . . . . 6  |-  ( x  =  y  ->  A  =  B )
16 ltord.4 . . . . . 6  |-  S  C_  RR
17 ltord.5 . . . . . 6  |-  ( (
ph  /\  x  e.  S )  ->  A  e.  RR )
18 ltord.6 . . . . . 6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  A  <  B ) )
1915, 5, 10, 16, 17, 18ltordlem 8800 . . . . 5  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  <  D  ->  M  <  N ) )
2019con3d 640 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( -.  M  < 
N  ->  -.  C  <  D ) )
2115, 10, 5, 16, 17, 18ltordlem 8800 . . . . . 6  |-  ( (
ph  /\  ( D  e.  S  /\  C  e.  S ) )  -> 
( D  <  C  ->  N  <  M ) )
2221con3d 640 . . . . 5  |-  ( (
ph  /\  ( D  e.  S  /\  C  e.  S ) )  -> 
( -.  N  < 
M  ->  -.  D  <  C ) )
2322ancom2s 572 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( -.  N  < 
M  ->  -.  D  <  C ) )
2420, 23anim12d 335 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( ( -.  M  <  N  /\  -.  N  <  M )  ->  ( -.  C  <  D  /\  -.  D  <  C ) ) )
2517ralrimiva 2623 . . . . . 6  |-  ( ph  ->  A. x  e.  S  A  e.  RR )
265eleq1d 2307 . . . . . . 7  |-  ( x  =  C  ->  ( A  e.  RR  <->  M  e.  RR ) )
2726rspccva 2928 . . . . . 6  |-  ( ( A. x  e.  S  A  e.  RR  /\  C  e.  S )  ->  M  e.  RR )
2825, 27sylan 283 . . . . 5  |-  ( (
ph  /\  C  e.  S )  ->  M  e.  RR )
2928adantrr 483 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  M  e.  RR )
3010eleq1d 2307 . . . . . . 7  |-  ( x  =  D  ->  ( A  e.  RR  <->  N  e.  RR ) )
3130rspccva 2928 . . . . . 6  |-  ( ( A. x  e.  S  A  e.  RR  /\  D  e.  S )  ->  N  e.  RR )
3225, 31sylan 283 . . . . 5  |-  ( (
ph  /\  D  e.  S )  ->  N  e.  RR )
3332adantrl 482 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  N  e.  RR )
3429, 33lttri3d 8430 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( M  =  N  <-> 
( -.  M  < 
N  /\  -.  N  <  M ) ) )
3516, 1sselid 3246 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  C  e.  RR )
36 simprr 537 . . . . 5  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  D  e.  S )
3716, 36sselid 3246 . . . 4  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  ->  D  e.  RR )
3835, 37lttri3d 8430 . . 3  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <-> 
( -.  C  < 
D  /\  -.  D  <  C ) ) )
3924, 34, 383imtr4d 203 . 2  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( M  =  N  ->  C  =  D ) )
4014, 39impbid 129 1  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  =  D  <-> 
M  =  N ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528    C_ wss 3220   class class class wbr 4125   RRcr 8168    < clt 8350
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-pre-ltirr 8281  ax-pre-apti 8284
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-xp 4775  df-pnf 8352  df-mnf 8353  df-ltxr 8355
This theorem is referenced by:  eqord2  8802  reef11  12444  nninfdclemf1  13321
  Copyright terms: Public domain W3C validator