Theorem ecunres 39103

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 5995	. . 3 ⊢ ((𝑅 ∪ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴))
2	1	eceq2i 8743	. 2 ⊢ [𝐵]((𝑅 ∪ 𝑆) ↾ 𝐴) = [𝐵]((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴))
3		ecun 39102	. 2 ⊢ (𝐵 ∈ 𝑉 → [𝐵]((𝑅 ↾ 𝐴) ∪ (𝑆 ↾ 𝐴)) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](𝑆 ↾ 𝐴)))
4	2, 3	eqtrid 2812	1 ⊢ (𝐵 ∈ 𝑉 → [𝐵]((𝑅 ∪ 𝑆) ↾ 𝐴) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](𝑆 ↾ 𝐴)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146   ∪ cun 3904   ↾ cres 5665  [cec 8698

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 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ec 8702

This theorem is used by:  ecuncnvepres  39104