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

Theorem ltrelxr 7080
Description: 'Less than' is a relation on extended reals. (Contributed by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
ltrelxr  |-  <  C_  ( RR*  X.  RR* )

Proof of Theorem ltrelxr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ltxr 7065 . 2  |-  <  =  ( { <. x ,  y
>.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  u.  (
( ( RR  u.  { -oo } )  X. 
{ +oo } )  u.  ( { -oo }  X.  RR ) ) )
2 df-3an 887 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y )  <->  ( (
x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) )
32opabbii 3824 . . . . 5  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  =  { <. x ,  y
>.  |  ( (
x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) }
4 opabssxp 4414 . . . . 5  |-  { <. x ,  y >.  |  ( ( x  e.  RR  /\  y  e.  RR )  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
53, 4eqsstri 2975 . . . 4  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR  X.  RR )
6 rexpssxrxp 7070 . . . 4  |-  ( RR 
X.  RR )  C_  ( RR*  X.  RR* )
75, 6sstri 2954 . . 3  |-  { <. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  C_  ( RR*  X.  RR* )
8 ressxr 7069 . . . . . 6  |-  RR  C_  RR*
9 snsspr2 3513 . . . . . . 7  |-  { -oo } 
C_  { +oo , -oo }
10 ssun2 3107 . . . . . . . 8  |-  { +oo , -oo }  C_  ( RR  u.  { +oo , -oo } )
11 df-xr 7064 . . . . . . . 8  |-  RR*  =  ( RR  u.  { +oo , -oo } )
1210, 11sseqtr4i 2978 . . . . . . 7  |-  { +oo , -oo }  C_  RR*
139, 12sstri 2954 . . . . . 6  |-  { -oo } 
C_  RR*
148, 13unssi 3118 . . . . 5  |-  ( RR  u.  { -oo }
)  C_  RR*
15 snsspr1 3512 . . . . . 6  |-  { +oo } 
C_  { +oo , -oo }
1615, 12sstri 2954 . . . . 5  |-  { +oo } 
C_  RR*
17 xpss12 4445 . . . . 5  |-  ( ( ( RR  u.  { -oo } )  C_  RR*  /\  { +oo }  C_  RR* )  -> 
( ( RR  u.  { -oo } )  X. 
{ +oo } )  C_  ( RR*  X.  RR* )
)
1814, 16, 17mp2an 402 . . . 4  |-  ( ( RR  u.  { -oo } )  X.  { +oo } )  C_  ( RR*  X. 
RR* )
19 xpss12 4445 . . . . 5  |-  ( ( { -oo }  C_  RR* 
/\  RR  C_  RR* )  ->  ( { -oo }  X.  RR )  C_  ( RR*  X.  RR* ) )
2013, 8, 19mp2an 402 . . . 4  |-  ( { -oo }  X.  RR )  C_  ( RR*  X.  RR* )
2118, 20unssi 3118 . . 3  |-  ( ( ( RR  u.  { -oo } )  X.  { +oo } )  u.  ( { -oo }  X.  RR ) )  C_  ( RR*  X.  RR* )
227, 21unssi 3118 . 2  |-  ( {
<. x ,  y >.  |  ( x  e.  RR  /\  y  e.  RR  /\  x  <RR  y ) }  u.  (
( ( RR  u.  { -oo } )  X. 
{ +oo } )  u.  ( { -oo }  X.  RR ) ) ) 
C_  ( RR*  X.  RR* )
231, 22eqsstri 2975 1  |-  <  C_  ( RR*  X.  RR* )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    /\ w3a 885    e. wcel 1393    u. cun 2915    C_ wss 2917   {csn 3375   {cpr 3376   class class class wbr 3764   {copab 3817    X. cxp 4343   RRcr 6888    <RR cltrr 6893   +oocpnf 7057   -oocmnf 7058   RR*cxr 7059    < clt 7060
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pr 3382  df-opab 3819  df-xp 4351  df-xr 7064  df-ltxr 7065
This theorem is referenced by:  ltrel  7081
  Copyright terms: Public domain W3C validator