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

Theorem gtndiv 9741
Description: A larger number does not divide a smaller positive integer. (Contributed by NM, 3-May-2005.)
Assertion
Ref Expression
gtndiv  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  -.  ( B  /  A
)  e.  ZZ )

Proof of Theorem gtndiv
StepHypRef Expression
1 nnre 9311 . . . 4  |-  ( B  e.  NN  ->  B  e.  RR )
213ad2ant2 1050 . . 3  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  B  e.  RR )
3 simp1 1028 . . 3  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  A  e.  RR )
4 nngt0 9329 . . . 4  |-  ( B  e.  NN  ->  0  <  B )
543ad2ant2 1050 . . 3  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  0  <  B )
64adantl 277 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  NN )  ->  0  <  B )
7 0re 8326 . . . . . . . 8  |-  0  e.  RR
8 lttr 8399 . . . . . . . 8  |-  ( ( 0  e.  RR  /\  B  e.  RR  /\  A  e.  RR )  ->  (
( 0  <  B  /\  B  <  A )  ->  0  <  A
) )
97, 8mp3an1 1365 . . . . . . 7  |-  ( ( B  e.  RR  /\  A  e.  RR )  ->  ( ( 0  < 
B  /\  B  <  A )  ->  0  <  A ) )
101, 9sylan 283 . . . . . 6  |-  ( ( B  e.  NN  /\  A  e.  RR )  ->  ( ( 0  < 
B  /\  B  <  A )  ->  0  <  A ) )
1110ancoms 268 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  NN )  ->  ( ( 0  < 
B  /\  B  <  A )  ->  0  <  A ) )
126, 11mpand 433 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  NN )  ->  ( B  <  A  ->  0  <  A ) )
13123impia 1231 . . 3  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  0  <  A )
142, 3, 5, 13divgt0d 9265 . 2  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  0  <  ( B  /  A
) )
15 simp3 1030 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  B  <  A )
16 1re 8325 . . . . . . 7  |-  1  e.  RR
17 ltdivmul2 9208 . . . . . . 7  |-  ( ( B  e.  RR  /\  1  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  -> 
( ( B  /  A )  <  1  <->  B  <  ( 1  x.  A ) ) )
1816, 17mp3an2 1366 . . . . . 6  |-  ( ( B  e.  RR  /\  ( A  e.  RR  /\  0  <  A ) )  ->  ( ( B  /  A )  <  1  <->  B  <  ( 1  x.  A ) ) )
192, 3, 13, 18syl12anc 1276 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  (
( B  /  A
)  <  1  <->  B  <  ( 1  x.  A ) ) )
20 recn 8312 . . . . . . . 8  |-  ( A  e.  RR  ->  A  e.  CC )
2120mullidd 8344 . . . . . . 7  |-  ( A  e.  RR  ->  (
1  x.  A )  =  A )
2221breq2d 4142 . . . . . 6  |-  ( A  e.  RR  ->  ( B  <  ( 1  x.  A )  <->  B  <  A ) )
23223ad2ant1 1049 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  ( B  <  ( 1  x.  A )  <->  B  <  A ) )
2419, 23bitrd 188 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  (
( B  /  A
)  <  1  <->  B  <  A ) )
2515, 24mpbird 167 . . 3  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  ( B  /  A )  <  1 )
26 0p1e1 9418 . . 3  |-  ( 0  +  1 )  =  1
2725, 26breqtrrdi 4172 . 2  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  ( B  /  A )  < 
( 0  +  1 ) )
28 0z 9655 . . 3  |-  0  e.  ZZ
29 btwnnz 9740 . . 3  |-  ( ( 0  e.  ZZ  /\  0  <  ( B  /  A )  /\  ( B  /  A )  < 
( 0  +  1 ) )  ->  -.  ( B  /  A
)  e.  ZZ )
3028, 29mp3an1 1365 . 2  |-  ( ( 0  <  ( B  /  A )  /\  ( B  /  A
)  <  ( 0  +  1 ) )  ->  -.  ( B  /  A )  e.  ZZ )
3114, 27, 30syl2anc 415 1  |-  ( ( A  e.  RR  /\  B  e.  NN  /\  B  <  A )  ->  -.  ( B  /  A
)  e.  ZZ )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184    < clt 8360    / cdiv 9002   NNcn 9304   ZZcz 9644
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-3or 1010  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-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645
This theorem is used by:  prime  9745
  Copyright terms: Public domain W3C validator