Theorem modfsummodslem1 15881

Description: Lemma 1 for modfsummods 15882. (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 4627	. . 3 ⊢ 𝑧 ∈ {𝑧}
2		elun2 4132	. . 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 2145  ∀wral 3078  ⦋csb 3850   ∪ cun 3900  {csn 4587  ℤcz 12618

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-sn 4588

This theorem is used by:  modfsummods  15882