Theorem modfsummodslem1 15851

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

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2142  ∀wral 3078  ⦋csb 3852   ∪ cun 3902  {csn 4588  ℤcz 12597

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-sn 4589

This theorem is used by:  modfsummods  15852