MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gcdcllem2 Structured version   Unicode version

Theorem gcdcllem2 13012
Description: Lemma for gcdn0cl 13014, gcddvds 13015 and dvdslegcd 13016. (Contributed by Paul Chapman, 21-Mar-2011.)
Hypotheses
Ref Expression
gcdcllem2.1  |-  S  =  { z  e.  ZZ  |  A. n  e.  { M ,  N }
z  ||  n }
gcdcllem2.2  |-  R  =  { z  e.  ZZ  |  ( z  ||  M  /\  z  ||  N
) }
Assertion
Ref Expression
gcdcllem2  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  R  =  S )
Distinct variable groups:    z, n, M    n, N, z
Allowed substitution hints:    R( z, n)    S( z, n)

Proof of Theorem gcdcllem2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 breq1 4215 . . . . . 6  |-  ( z  =  x  ->  (
z  ||  n  <->  x  ||  n
) )
21ralbidv 2725 . . . . 5  |-  ( z  =  x  ->  ( A. n  e.  { M ,  N } z  ||  n 
<-> 
A. n  e.  { M ,  N }
x  ||  n )
)
3 gcdcllem2.1 . . . . 5  |-  S  =  { z  e.  ZZ  |  A. n  e.  { M ,  N }
z  ||  n }
42, 3elrab2 3094 . . . 4  |-  ( x  e.  S  <->  ( x  e.  ZZ  /\  A. n  e.  { M ,  N } x  ||  n ) )
5 breq2 4216 . . . . . 6  |-  ( n  =  M  ->  (
x  ||  n  <->  x  ||  M
) )
6 breq2 4216 . . . . . 6  |-  ( n  =  N  ->  (
x  ||  n  <->  x  ||  N
) )
75, 6ralprg 3857 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( A. n  e. 
{ M ,  N } x  ||  n  <->  ( x  ||  M  /\  x  ||  N ) ) )
87anbi2d 685 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( x  e.  ZZ  /\  A. n  e.  { M ,  N } x  ||  n )  <-> 
( x  e.  ZZ  /\  ( x  ||  M  /\  x  ||  N ) ) ) )
94, 8syl5bb 249 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( x  e.  S  <->  ( x  e.  ZZ  /\  ( x  ||  M  /\  x  ||  N ) ) ) )
10 breq1 4215 . . . . 5  |-  ( z  =  x  ->  (
z  ||  M  <->  x  ||  M
) )
11 breq1 4215 . . . . 5  |-  ( z  =  x  ->  (
z  ||  N  <->  x  ||  N
) )
1210, 11anbi12d 692 . . . 4  |-  ( z  =  x  ->  (
( z  ||  M  /\  z  ||  N )  <-> 
( x  ||  M  /\  x  ||  N ) ) )
13 gcdcllem2.2 . . . 4  |-  R  =  { z  e.  ZZ  |  ( z  ||  M  /\  z  ||  N
) }
1412, 13elrab2 3094 . . 3  |-  ( x  e.  R  <->  ( x  e.  ZZ  /\  ( x 
||  M  /\  x  ||  N ) ) )
159, 14syl6rbbr 256 . 2  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( x  e.  R  <->  x  e.  S ) )
1615eqrdv 2434 1  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  R  =  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1652    e. wcel 1725   A.wral 2705   {crab 2709   {cpr 3815   class class class wbr 4212   ZZcz 10282    || cdivides 12852
This theorem is referenced by:  gcdcllem3  13013
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ral 2710  df-rab 2714  df-v 2958  df-sbc 3162  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-br 4213
  Copyright terms: Public domain W3C validator