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

Theorem modfsummodslem1 14524
Description: Lemma 1 for modfsummods 14525. (Contributed by Alexander van der Vekens, 1-Sep-2018.)
Assertion
Ref Expression
modfsummodslem1  |-  ( A. k  e.  ( A  u.  { z } ) B  e.  ZZ  ->  [_ z  /  k ]_ B  e.  ZZ )
Distinct variable groups:    A, k    z, k
Allowed substitution hints:    A( z)    B( z, k)

Proof of Theorem modfsummodslem1
StepHypRef Expression
1 vsnid 4209 . . 3  |-  z  e. 
{ z }
2 elun2 3781 . . 3  |-  ( z  e.  { z }  ->  z  e.  ( A  u.  { z } ) )
31, 2ax-mp 5 . 2  |-  z  e.  ( A  u.  {
z } )
4 rspcsbela 4006 . 2  |-  ( ( z  e.  ( A  u.  { z } )  /\  A. k  e.  ( A  u.  {
z } ) B  e.  ZZ )  ->  [_ z  /  k ]_ B  e.  ZZ )
53, 4mpan 706 1  |-  ( A. k  e.  ( A  u.  { z } ) B  e.  ZZ  ->  [_ z  /  k ]_ B  e.  ZZ )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    e. wcel 1990   A.wral 2912   [_csb 3533    u. cun 3572   {csn 4177   ZZcz 11377
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-sn 4178
This theorem is referenced by:  modfsummods  14525
  Copyright terms: Public domain W3C validator