Theorem elecex 8696

Description: Condition for a coset to be a set. (Contributed by Peter Mazsa, 4-May-2019.)

Assertion

Ref	Expression
elecex	⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → (𝐵 ∈ 𝐴 → [𝐵]𝑅 ∈ V))

Proof of Theorem elecex

Step	Hyp	Ref	Expression
1		ecexg 8649	. 2 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → [𝐵](𝑅 ↾ 𝐴) ∈ V)
2		elecreseq 8695	. . 3 ⊢ (𝐵 ∈ 𝐴 → [𝐵](𝑅 ↾ 𝐴) = [𝐵]𝑅)
3	2	eleq1d 2822	. 2 ⊢ (𝐵 ∈ 𝐴 → ([𝐵](𝑅 ↾ 𝐴) ∈ V ↔ [𝐵]𝑅 ∈ V))
4	1, 3	syl5ibcom 245	1 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → (𝐵 ∈ 𝐴 → [𝐵]𝑅 ∈ V))

Syntax hints:   → wi 4   ∈ wcel 2114  Vcvv 3442   ↾ cres 5634  [cec 8643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-cnv 5640  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ec 8647

This theorem is referenced by:  ecelqs  8716  uniqs  8722  disjqmap2  39077