Theorem ecunres 39463

Description: The restricted union coset of 𝐵. (Contributed by Peter Mazsa, 28-Jan-2026.)

Assertion

Ref	Expression
ecunres	⊢ (𝐵 ∈ 𝑉 → [𝐵]((𝑅 ∪ 𝑆) ↾ 𝐴) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](𝑆 ↾ 𝐴)))

Proof of Theorem ecunres

Step	Hyp	Ref	Expression
1		resundir 5986	. . 3 ⊢ ((𝑅 ∪ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴))
2	1	eceq2i 8768	. 2 ⊢ [𝐵]((𝑅 ∪ 𝑆) ↾ 𝐴) = [𝐵]((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴))
3		ecun 39462	. 2 ⊢ (𝐵 ∈ 𝑉 → [𝐵]((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴)) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](𝑆 ↾ 𝐴)))
4	2, 3	eqtrid 2807	1 ⊢ (𝐵 ∈ 𝑉 → [𝐵]((𝑅 ∪ 𝑆) ↾ 𝐴) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](𝑆 ↾ 𝐴)))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144   ∪ cun 4148   ↾ cres 5653  [cec 8723

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-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ec 8727

This theorem is used by:  ecuncnvepres  39464