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

Theorem modfsummodslem1 15135
Description: Lemma 1 for modfsummods 15136. (Contributed by Alexander van der Vekens, 1-Sep-2018.)
Assertion
Ref Expression
modfsummodslem1 (∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ → 𝑧 / 𝑘𝐵 ∈ ℤ)
Distinct variable groups:   𝐴,𝑘   𝑧,𝑘
Allowed substitution hints:   𝐴(𝑧)   𝐵(𝑧,𝑘)

Proof of Theorem modfsummodslem1
StepHypRef Expression
1 vsnid 4592 . . 3 𝑧 ∈ {𝑧}
2 elun2 4150 . . 3 (𝑧 ∈ {𝑧} → 𝑧 ∈ (𝐴 ∪ {𝑧}))
31, 2ax-mp 5 . 2 𝑧 ∈ (𝐴 ∪ {𝑧})
4 rspcsbela 4384 . 2 ((𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ ∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ) → 𝑧 / 𝑘𝐵 ∈ ℤ)
53, 4mpan 686 1 (∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ → 𝑧 / 𝑘𝐵 ∈ ℤ)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2105  wral 3135  csb 3880  cun 3931  {csn 4557  cz 11969
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-fal 1541  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-sn 4558
This theorem is referenced by:  modfsummods  15136
  Copyright terms: Public domain W3C validator