MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ltordlem Structured version   Unicode version

Theorem ltordlem 9886
Description: Lemma for ltord1 9887. (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 )
ltord.6  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  A  <  B ) )
Assertion
Ref Expression
ltordlem  |-  ( (
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 ltordlem
StepHypRef Expression
1 ltord.6 . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  <  y  ->  A  <  B ) )
21ralrimivva 2829 . 2  |-  ( ph  ->  A. x  e.  S  A. y  e.  S  ( x  <  y  ->  A  <  B ) )
3 breq1 4316 . . . 4  |-  ( x  =  C  ->  (
x  <  y  <->  C  <  y ) )
4 ltord.2 . . . . 5  |-  ( x  =  C  ->  A  =  M )
54breq1d 4323 . . . 4  |-  ( x  =  C  ->  ( A  <  B  <->  M  <  B ) )
63, 5imbi12d 320 . . 3  |-  ( x  =  C  ->  (
( x  <  y  ->  A  <  B )  <-> 
( C  <  y  ->  M  <  B ) ) )
7 breq2 4317 . . . 4  |-  ( y  =  D  ->  ( C  <  y  <->  C  <  D ) )
8 eqeq1 2449 . . . . . . 7  |-  ( x  =  y  ->  (
x  =  D  <->  y  =  D ) )
9 ltord.1 . . . . . . . 8  |-  ( x  =  y  ->  A  =  B )
109eqeq1d 2451 . . . . . . 7  |-  ( x  =  y  ->  ( A  =  N  <->  B  =  N ) )
118, 10imbi12d 320 . . . . . 6  |-  ( x  =  y  ->  (
( x  =  D  ->  A  =  N )  <->  ( y  =  D  ->  B  =  N ) ) )
12 ltord.3 . . . . . 6  |-  ( x  =  D  ->  A  =  N )
1311, 12chvarv 1958 . . . . 5  |-  ( y  =  D  ->  B  =  N )
1413breq2d 4325 . . . 4  |-  ( y  =  D  ->  ( M  <  B  <->  M  <  N ) )
157, 14imbi12d 320 . . 3  |-  ( y  =  D  ->  (
( C  <  y  ->  M  <  B )  <-> 
( C  <  D  ->  M  <  N ) ) )
166, 15rspc2v 3100 . 2  |-  ( ( C  e.  S  /\  D  e.  S )  ->  ( A. x  e.  S  A. y  e.  S  ( x  < 
y  ->  A  <  B )  ->  ( C  <  D  ->  M  <  N ) ) )
172, 16mpan9 469 1  |-  ( (
ph  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( C  <  D  ->  M  <  N ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1369    e. wcel 1756   A.wral 2736    C_ wss 3349   class class class wbr 4313   RRcr 9302    < clt 9439
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ral 2741  df-rab 2745  df-v 2995  df-dif 3352  df-un 3354  df-in 3356  df-ss 3363  df-nul 3659  df-if 3813  df-sn 3899  df-pr 3901  df-op 3905  df-br 4314
This theorem is referenced by:  ltord1  9887
  Copyright terms: Public domain W3C validator