Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sltsgn1 Unicode version

Theorem sltsgn1 24315
Description: If  A < s B, then the sign of  A at the first place they differ is either undefined or  1o (Contributed by Scott Fenton, 4-Sep-2011.)
Assertion
Ref Expression
sltsgn1  |-  ( ( A  e.  No  /\  B  e.  No )  ->  ( A < s B  ->  ( ( A `
 |^| { k  e.  On  |  ( A `
 k )  =/=  ( B `  k
) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) ) )
Distinct variable groups:    A, k    B, k

Proof of Theorem sltsgn1
StepHypRef Expression
1 sltval2 24310 . 2  |-  ( ( A  e.  No  /\  B  e.  No )  ->  ( A < s B 
<->  ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } ) { <. 1o ,  (/)
>. ,  <. 1o ,  2o >. ,  <. (/) ,  2o >. }  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } ) ) )
2 fvex 5539 . . . 4  |-  ( A `
 |^| { k  e.  On  |  ( A `
 k )  =/=  ( B `  k
) } )  e. 
_V
3 fvex 5539 . . . 4  |-  ( B `
 |^| { k  e.  On  |  ( A `
 k )  =/=  ( B `  k
) } )  e. 
_V
42, 3brtp 24106 . . 3  |-  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } ) { <. 1o ,  (/) >. ,  <. 1o ,  2o >. ,  <. (/) ,  2o >. }  ( B `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  <->  ( ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/) )  \/  (
( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  1o  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  2o )  \/  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  /\  ( B `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  2o ) ) )
5 olc 373 . . . . 5  |-  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o  ->  (
( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) )
65adantr 451 . . . 4  |-  ( ( ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  1o  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/) )  ->  (
( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) )
75adantr 451 . . . 4  |-  ( ( ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  1o  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  2o )  -> 
( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  1o ) )
8 orc 374 . . . . 5  |-  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  ->  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) )
98adantr 451 . . . 4  |-  ( ( ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  (/)  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  2o )  -> 
( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  1o ) )
106, 7, 93jaoi 1245 . . 3  |-  ( ( ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o 
/\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/) )  \/  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o  /\  ( B `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  2o )  \/  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  /\  ( B `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  =  2o ) )  ->  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) )
114, 10sylbi 187 . 2  |-  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } ) { <. 1o ,  (/) >. ,  <. 1o ,  2o >. ,  <. (/) ,  2o >. }  ( B `  |^| { k  e.  On  | 
( A `  k
)  =/=  ( B `
 k ) } )  ->  ( ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) )
121, 11syl6bi 219 1  |-  ( ( A  e.  No  /\  B  e.  No )  ->  ( A < s B  ->  ( ( A `
 |^| { k  e.  On  |  ( A `
 k )  =/=  ( B `  k
) } )  =  (/)  \/  ( A `  |^| { k  e.  On  |  ( A `  k )  =/=  ( B `  k ) } )  =  1o ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 357    /\ wa 358    \/ w3o 933    = wceq 1623    e. wcel 1684    =/= wne 2446   {crab 2547   (/)c0 3455   {ctp 3642   <.cop 3643   |^|cint 3862   class class class wbr 4023   Oncon0 4392   ` cfv 5255   1oc1o 6472   2oc2o 6473   Nocsur 24294   < scslt 24295
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-int 3863  df-br 4024  df-opab 4078  df-tr 4114  df-eprel 4305  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-suc 4398  df-iota 5219  df-fv 5263  df-1o 6479  df-2o 6480  df-slt 24298
  Copyright terms: Public domain W3C validator