Theorem ecun 39102

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 4261	. . 3 ⊢ ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)}
2	1	a1i 11	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)})
3		dfec2 8703	. . 3 ⊢ (𝐴 ∈ 𝑉 → [𝐴]𝑅 = {𝑥 ∣ 𝐴𝑅𝑥})
4		dfec2 8703	. . 3 ⊢ (𝐴 ∈ 𝑉 → [𝐴]𝑆 = {𝑥 ∣ 𝐴𝑆𝑥})
5	3, 4	uneq12d 4123	. 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴]𝑅 ∪ [𝐴]𝑆) = ({𝑥 ∣ 𝐴𝑅𝑥} ∪ {𝑥 ∣ 𝐴𝑆𝑥}))
6		elecALTV 38980	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ V) → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ 𝐴(𝑅 ∪ 𝑆)𝑥))
7	6	elvd 3463	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ 𝐴(𝑅 ∪ 𝑆)𝑥))
8		brun 5164	. . . 4 ⊢ (𝐴(𝑅 ∪ 𝑆)𝑥 ↔ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥))
9	7, 8	bitrdi 290	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ [𝐴](𝑅 ∪ 𝑆) ↔ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)))
10	9	eqabdv 2898	. 2 ⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ∪ 𝑆) = {𝑥 ∣ (𝐴𝑅𝑥 ∨ 𝐴𝑆𝑥)})
11	2, 5, 10	3eqtr4rd 2811	1 ⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ∪ 𝑆) = ([𝐴]𝑅 ∪ [𝐴]𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2146  {cab 2743  Vcvv 3457   ∪ cun 3904   class class class wbr 5111  [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:  ecunres  39103