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

Theorem lgslem3 15875
Description: The set  Z of all integers with absolute value at most  1 is closed under multiplication. (Contributed by Mario Carneiro, 4-Feb-2015.)
Hypothesis
Ref Expression
lgslem2.z  |-  Z  =  { x  e.  ZZ  |  ( abs `  x
)  <_  1 }
Assertion
Ref Expression
lgslem3  |-  ( ( A  e.  Z  /\  B  e.  Z )  ->  ( A  x.  B
)  e.  Z )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    Z( x)

Proof of Theorem lgslem3
StepHypRef Expression
1 zmulcl 9631 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  x.  B
)  e.  ZZ )
21ad2ant2r 509 . . 3  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  ( A  x.  B )  e.  ZZ )
3 zcn 9582 . . . . . 6  |-  ( A  e.  ZZ  ->  A  e.  CC )
4 zcn 9582 . . . . . 6  |-  ( B  e.  ZZ  ->  B  e.  CC )
5 absmul 11754 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( abs `  ( A  x.  B )
)  =  ( ( abs `  A )  x.  ( abs `  B
) ) )
63, 4, 5syl2an 289 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( abs `  ( A  x.  B )
)  =  ( ( abs `  A )  x.  ( abs `  B
) ) )
76ad2ant2r 509 . . . 4  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  ( abs `  ( A  x.  B ) )  =  ( ( abs `  A
)  x.  ( abs `  B ) ) )
8 abscl 11736 . . . . . . . . . . 11  |-  ( A  e.  CC  ->  ( abs `  A )  e.  RR )
9 absge0 11745 . . . . . . . . . . 11  |-  ( A  e.  CC  ->  0  <_  ( abs `  A
) )
108, 9jca 306 . . . . . . . . . 10  |-  ( A  e.  CC  ->  (
( abs `  A
)  e.  RR  /\  0  <_  ( abs `  A
) ) )
113, 10syl 14 . . . . . . . . 9  |-  ( A  e.  ZZ  ->  (
( abs `  A
)  e.  RR  /\  0  <_  ( abs `  A
) ) )
1211adantr 276 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( abs `  A
)  e.  RR  /\  0  <_  ( abs `  A
) ) )
13 1red 8289 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  1  e.  RR )
14 abscl 11736 . . . . . . . . . . 11  |-  ( B  e.  CC  ->  ( abs `  B )  e.  RR )
15 absge0 11745 . . . . . . . . . . 11  |-  ( B  e.  CC  ->  0  <_  ( abs `  B
) )
1614, 15jca 306 . . . . . . . . . 10  |-  ( B  e.  CC  ->  (
( abs `  B
)  e.  RR  /\  0  <_  ( abs `  B
) ) )
174, 16syl 14 . . . . . . . . 9  |-  ( B  e.  ZZ  ->  (
( abs `  B
)  e.  RR  /\  0  <_  ( abs `  B
) ) )
1817adantl 277 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( abs `  B
)  e.  RR  /\  0  <_  ( abs `  B
) ) )
19 lemul12a 9136 . . . . . . . 8  |-  ( ( ( ( ( abs `  A )  e.  RR  /\  0  <_  ( abs `  A ) )  /\  1  e.  RR )  /\  ( ( ( abs `  B )  e.  RR  /\  0  <_  ( abs `  B ) )  /\  1  e.  RR )
)  ->  ( (
( abs `  A
)  <_  1  /\  ( abs `  B )  <_  1 )  -> 
( ( abs `  A
)  x.  ( abs `  B ) )  <_ 
( 1  x.  1 ) ) )
2012, 13, 18, 13, 19syl22anc 1275 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( abs `  A )  <_  1  /\  ( abs `  B
)  <_  1 )  ->  ( ( abs `  A )  x.  ( abs `  B ) )  <_  ( 1  x.  1 ) ) )
2120imp 124 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( ( abs `  A )  <_  1  /\  ( abs `  B
)  <_  1 ) )  ->  ( ( abs `  A )  x.  ( abs `  B
) )  <_  (
1  x.  1 ) )
2221an4s 592 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  (
( abs `  A
)  x.  ( abs `  B ) )  <_ 
( 1  x.  1 ) )
23 1t1e1 9390 . . . . 5  |-  ( 1  x.  1 )  =  1
2422, 23breqtrdi 4150 . . . 4  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  (
( abs `  A
)  x.  ( abs `  B ) )  <_ 
1 )
257, 24eqbrtrd 4131 . . 3  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  ( abs `  ( A  x.  B ) )  <_ 
1 )
262, 25jca 306 . 2  |-  ( ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )  ->  (
( A  x.  B
)  e.  ZZ  /\  ( abs `  ( A  x.  B ) )  <_  1 ) )
27 fveq2 5670 . . . . 5  |-  ( x  =  A  ->  ( abs `  x )  =  ( abs `  A
) )
2827breq1d 4119 . . . 4  |-  ( x  =  A  ->  (
( abs `  x
)  <_  1  <->  ( abs `  A )  <_  1
) )
29 lgslem2.z . . . 4  |-  Z  =  { x  e.  ZZ  |  ( abs `  x
)  <_  1 }
3028, 29elrab2 2976 . . 3  |-  ( A  e.  Z  <->  ( A  e.  ZZ  /\  ( abs `  A )  <_  1
) )
31 fveq2 5670 . . . . 5  |-  ( x  =  B  ->  ( abs `  x )  =  ( abs `  B
) )
3231breq1d 4119 . . . 4  |-  ( x  =  B  ->  (
( abs `  x
)  <_  1  <->  ( abs `  B )  <_  1
) )
3332, 29elrab2 2976 . . 3  |-  ( B  e.  Z  <->  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) )
3430, 33anbi12i 460 . 2  |-  ( ( A  e.  Z  /\  B  e.  Z )  <->  ( ( A  e.  ZZ  /\  ( abs `  A
)  <_  1 )  /\  ( B  e.  ZZ  /\  ( abs `  B )  <_  1
) ) )
35 fveq2 5670 . . . 4  |-  ( x  =  ( A  x.  B )  ->  ( abs `  x )  =  ( abs `  ( A  x.  B )
) )
3635breq1d 4119 . . 3  |-  ( x  =  ( A  x.  B )  ->  (
( abs `  x
)  <_  1  <->  ( abs `  ( A  x.  B
) )  <_  1
) )
3736, 29elrab2 2976 . 2  |-  ( ( A  x.  B )  e.  Z  <->  ( ( A  x.  B )  e.  ZZ  /\  ( abs `  ( A  x.  B
) )  <_  1
) )
3826, 34, 373imtr4i 201 1  |-  ( ( A  e.  Z  /\  B  e.  Z )  ->  ( A  x.  B
)  e.  Z )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   {crab 2524   class class class wbr 4109   ` cfv 5352  (class class class)co 6050   CCcc 8125   RRcr 8126   0cc0 8127   1c1 8128    x. cmul 8132    <_ cle 8309   ZZcz 9577   abscabs 11682
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-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245  ax-arch 8246  ax-caucvg 8247
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  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 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-n0 9497  df-z 9578  df-uz 9854  df-rp 9987  df-seqfrec 10810  df-exp 10901  df-cj 11527  df-re 11528  df-im 11529  df-rsqrt 11683  df-abs 11684
This theorem is referenced by:  lgsfcl2  15879  lgscllem  15880  lgsdirprm  15907
  Copyright terms: Public domain W3C validator