Theorem ecuncnvepres 39473

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

Assertion

Ref	Expression
ecuncnvepres	⊢ (𝐵 ∈ 𝐴 → [𝐵]((𝑅 ∪ ◡ E ) ↾ 𝐴) = (𝐵 ∪ [𝐵]𝑅))

Proof of Theorem ecuncnvepres

Step	Hyp	Ref	Expression
1		ecunres 39472	. . 3 ⊢ (𝐵 ∈ 𝐴 → [𝐵]((𝑅 ∪ ◡ E ) ↾ 𝐴) = ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](◡ E ↾ 𝐴)))
2		elecreseq 8781	. . . 4 ⊢ (𝐵 ∈ 𝐴 → [𝐵](𝑅 ↾ 𝐴) = [𝐵]𝑅)
3		eccnvepres2 39369	. . . 4 ⊢ (𝐵 ∈ 𝐴 → [𝐵](◡ E ↾ 𝐴) = 𝐵)
4	2, 3	uneq12d 4171	. . 3 ⊢ (𝐵 ∈ 𝐴 → ([𝐵](𝑅 ↾ 𝐴) ∪ [𝐵](◡ E ↾ 𝐴)) = ([𝐵]𝑅 ∪ 𝐵))
5	1, 4	eqtrd 2798	. 2 ⊢ (𝐵 ∈ 𝐴 → [𝐵]((𝑅 ∪ ◡ E ) ↾ 𝐴) = ([𝐵]𝑅 ∪ 𝐵))
6		uncom 4160	. 2 ⊢ ([𝐵]𝑅 ∪ 𝐵) = (𝐵 ∪ [𝐵]𝑅)
7	5, 6	eqtrdi 2814	1 ⊢ (𝐵 ∈ 𝐴 → [𝐵]((𝑅 ∪ ◡ E ) ↾ 𝐴) = (𝐵 ∪ [𝐵]𝑅))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146   ∪ cun 4152   E cep 5554  ^◡ccnv 5654   ↾ cres 5657  [cec 8729

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-pr 5395

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 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ec 8733

This theorem is used by:  dfadjliftmap2  39535  blockadjliftmap  39536