Theorem ecun 38931

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

Assertion

Ref	Expression
ecun	⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ∪ 𝑆) = ([𝐴]𝑅 ∪ [𝐴]𝑆))

Proof of Theorem ecun

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unab 4269	. . 3 ⊢ ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)}
2	1	a1i 11	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)})
3		dfec2 8696	. . 3 ⊢ (𝐴 ∈ 𝑉 → [𝐴]𝑅 = {𝑥 ∣ 𝐴𝑅𝑥})
4		dfec2 8696	. . 3 ⊢ (𝐴 ∈ 𝑉 → [𝐴]𝑆 = {𝑥 ∣ 𝐴𝑆𝑥})
5	3, 4	uneq12d 4131	. 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴]𝑅 ∪ [𝐴]𝑆) = ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}))
6		elecALTV 38809	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ V) → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ 𝐴(𝑅 ∪ 𝑆)𝑥))
7	6	elvd 3469	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ 𝐴(𝑅 ∪ 𝑆)𝑥))
8		brun 5166	. . . 4 ⊢ (𝐴(𝑅 ∪ 𝑆)𝑥 ↔ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥))
9	7, 8	bitrdi 290	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)))
10	9	eqabdv 2902	. 2 ⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ∪ 𝑆) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)})
11	2, 5, 10	3eqtr4rd 2815	1 ⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ∪ 𝑆) = ([𝐴]𝑅 ∪ [𝐴]𝑆))

Syntax hints:   → wi 4   ↔ wb 209   ∨ wo 860   = wceq 1567   ∈ wcel 2149  {cab 2747  Vcvv 3463   ∪ cun 3911   class class class wbr 5113  [cec 8691

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-xp 5668  df-cnv 5670  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ec 8695

This theorem is referenced by:  ecunres  38932