Theorem modfsummodslem1 15959

Description: Lemma 1 for modfsummods 15960. (Contributed by Alexander van der Vekens, 1-Sep-2018.)

Assertion

Ref	Expression
modfsummodslem1	⊢ (∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)

Distinct variable groups:   𝐴,𝑘   𝑧,𝑘

Allowed substitution hints:   𝐴(𝑧)   𝐵(𝑧, 𝑘)

Proof of Theorem modfsummodslem1

Step	Hyp	Ref	Expression
1		vsnid 4623	. . 3 ⊢ 𝑧 ∈ {𝑧}
2		elun2 4181	. . 3 ⊢ (𝑧 ∈ {𝑧} → 𝑧 ∈ (𝐴 ∪ {𝑧}))
3	1, 2	ax-mp 5	. 2 ⊢ 𝑧 ∈ (𝐴 ∪ {𝑧})
4		rspcsbela 4395	. 2 ⊢ ((𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ ∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ) → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)
5	3, 4	mpan 703	1 ⊢ (∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2144  ∀wral 3076  ⦋csb 3846   ∪ cun 4149  {csn 4583  ℤcz 12693

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-sn 4584

This theorem is used by:  modfsummods  15960