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

Theorem nndivtr 9267
Description: Transitive property of divisibility: if  A divides  B and  B divides  C, then  A divides  C. Typically,  C would be an integer, although the theorem holds for complex  C. (Contributed by NM, 3-May-2005.)
Assertion
Ref Expression
nndivtr  |-  ( ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  /\  ( ( B  /  A )  e.  NN  /\  ( C  /  B
)  e.  NN ) )  ->  ( C  /  A )  e.  NN )

Proof of Theorem nndivtr
StepHypRef Expression
1 nnmulcl 9246 . . 3  |-  ( ( ( B  /  A
)  e.  NN  /\  ( C  /  B
)  e.  NN )  ->  ( ( B  /  A )  x.  ( C  /  B
) )  e.  NN )
2 nncn 9233 . . . . . . 7  |-  ( B  e.  NN  ->  B  e.  CC )
323ad2ant2 1046 . . . . . 6  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  B  e.  CC )
4 simp3 1026 . . . . . 6  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  C  e.  CC )
5 nncn 9233 . . . . . . . 8  |-  ( A  e.  NN  ->  A  e.  CC )
6 nnap0 9254 . . . . . . . 8  |-  ( A  e.  NN  ->  A #  0 )
75, 6jca 306 . . . . . . 7  |-  ( A  e.  NN  ->  ( A  e.  CC  /\  A #  0 ) )
873ad2ant1 1045 . . . . . 6  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  ( A  e.  CC  /\  A #  0 ) )
9 nnap0 9254 . . . . . . . 8  |-  ( B  e.  NN  ->  B #  0 )
102, 9jca 306 . . . . . . 7  |-  ( B  e.  NN  ->  ( B  e.  CC  /\  B #  0 ) )
11103ad2ant2 1046 . . . . . 6  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  ( B  e.  CC  /\  B #  0 ) )
12 divmul24ap 8978 . . . . . 6  |-  ( ( ( B  e.  CC  /\  C  e.  CC )  /\  ( ( A  e.  CC  /\  A #  0 )  /\  ( B  e.  CC  /\  B #  0 ) ) )  ->  ( ( B  /  A )  x.  ( C  /  B
) )  =  ( ( B  /  B
)  x.  ( C  /  A ) ) )
133, 4, 8, 11, 12syl22anc 1275 . . . . 5  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
( B  /  A
)  x.  ( C  /  B ) )  =  ( ( B  /  B )  x.  ( C  /  A
) ) )
142, 9dividapd 9048 . . . . . . 7  |-  ( B  e.  NN  ->  ( B  /  B )  =  1 )
1514oveq1d 6056 . . . . . 6  |-  ( B  e.  NN  ->  (
( B  /  B
)  x.  ( C  /  A ) )  =  ( 1  x.  ( C  /  A
) ) )
16153ad2ant2 1046 . . . . 5  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
( B  /  B
)  x.  ( C  /  A ) )  =  ( 1  x.  ( C  /  A
) ) )
17 divclap 8940 . . . . . . . . . 10  |-  ( ( C  e.  CC  /\  A  e.  CC  /\  A #  0 )  ->  ( C  /  A )  e.  CC )
18173expb 1231 . . . . . . . . 9  |-  ( ( C  e.  CC  /\  ( A  e.  CC  /\  A #  0 ) )  ->  ( C  /  A )  e.  CC )
197, 18sylan2 286 . . . . . . . 8  |-  ( ( C  e.  CC  /\  A  e.  NN )  ->  ( C  /  A
)  e.  CC )
2019ancoms 268 . . . . . . 7  |-  ( ( A  e.  NN  /\  C  e.  CC )  ->  ( C  /  A
)  e.  CC )
2120mullidd 8280 . . . . . 6  |-  ( ( A  e.  NN  /\  C  e.  CC )  ->  ( 1  x.  ( C  /  A ) )  =  ( C  /  A ) )
22213adant2 1043 . . . . 5  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
1  x.  ( C  /  A ) )  =  ( C  /  A ) )
2313, 16, 223eqtrd 2269 . . . 4  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
( B  /  A
)  x.  ( C  /  B ) )  =  ( C  /  A ) )
2423eleq1d 2301 . . 3  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
( ( B  /  A )  x.  ( C  /  B ) )  e.  NN  <->  ( C  /  A )  e.  NN ) )
251, 24imbitrid 154 . 2  |-  ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  ->  (
( ( B  /  A )  e.  NN  /\  ( C  /  B
)  e.  NN )  ->  ( C  /  A )  e.  NN ) )
2625imp 124 1  |-  ( ( ( A  e.  NN  /\  B  e.  NN  /\  C  e.  CC )  /\  ( ( B  /  A )  e.  NN  /\  ( C  /  B
)  e.  NN ) )  ->  ( C  /  A )  e.  NN )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203   class class class wbr 4102  (class class class)co 6041   CCcc 8113   0cc0 8115   1c1 8116    x. cmul 8120   # cap 8843    / cdiv 8934   NNcn 9225
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4221  ax-pow 4279  ax-pr 4314  ax-un 4545  ax-setind 4650  ax-cnex 8206  ax-resscn 8207  ax-1cn 8208  ax-1re 8209  ax-icn 8210  ax-addcl 8211  ax-addrcl 8212  ax-mulcl 8213  ax-mulrcl 8214  ax-addcom 8215  ax-mulcom 8216  ax-addass 8217  ax-mulass 8218  ax-distr 8219  ax-i2m1 8220  ax-0lt1 8221  ax-1rid 8222  ax-0id 8223  ax-rnegex 8224  ax-precex 8225  ax-cnre 8226  ax-pre-ltirr 8227  ax-pre-ltwlin 8228  ax-pre-lttrn 8229  ax-pre-apti 8230  ax-pre-ltadd 8231  ax-pre-mulgt0 8232  ax-pre-mulext 8233
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3667  df-sn 3688  df-pr 3689  df-op 3691  df-uni 3908  df-int 3943  df-br 4103  df-opab 4165  df-id 4405  df-po 4408  df-iso 4409  df-xp 4746  df-rel 4747  df-cnv 4748  df-co 4749  df-dm 4750  df-iota 5303  df-fun 5345  df-fv 5351  df-riota 5994  df-ov 6044  df-oprab 6045  df-mpo 6046  df-pnf 8298  df-mnf 8299  df-xr 8300  df-ltxr 8301  df-le 8302  df-sub 8434  df-neg 8435  df-reap 8837  df-ap 8844  df-div 8935  df-inn 9226
This theorem is referenced by:  permnn  11119  infpnlem1  13035
  Copyright terms: Public domain W3C validator