Theorem modfsummodslem1 15985

Description: Lemma 1 for modfsummods 15986. (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 4624	. . 3 ⊢ 𝑧 ∈ {𝑧}
2		elun2 4184	. . 3 ⊢ (𝑧 ∈ {𝑧} → 𝑧 ∈ (𝐴 ∪ {𝑧}))
3	1, 2	ax-mp 5	. 2 ⊢ 𝑧 ∈ (𝐴 ∪ {𝑧})
4		rspcsbela 4399	. 2 ⊢ ((𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ ∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ) → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)
5	3, 4	mpan 703	1 ⊢ (∀𝑘 ∈ (𝐴 ∪ {𝑧})𝐵 ∈ ℤ → ⦋𝑧 / 𝑘⦌𝐵 ∈ ℤ)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147  ∀wral 3080  ⦋csb 3851   ∪ cun 4152  {csn 4588  ℤcz 12717

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-sn 4589

This theorem is used by:  modfsummods  15986