Theorem cnviun 44302

Description: Converse of indexed union. (Contributed by RP, 20-Jun-2020.)

Assertion

Ref	Expression
cnviun	⊢ ◡∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 ◡𝐵

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem cnviun

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 6107	. 2 ⊢ Rel ◡∪ 𝑥 ∈ 𝐴 𝐵
2		reliun 5804	. . 3 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 Rel ◡𝐵)
3		relcnv 6107	. . . 4 ⊢ Rel ◡𝐵
4	3	a1i 11	. . 3 ⊢ (𝑥 ∈ 𝐴 → Rel ◡𝐵)
5	2, 4	mprgbir 3092	. 2 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ◡𝐵
6		vex 3467	. . . . . 6 ⊢ 𝑦 ∈ V
7		vex 3467	. . . . . 6 ⊢ 𝑧 ∈ V
8	6, 7	opelcnv 5868	. . . . 5 ⊢ (⟨𝑦, 𝑧⟩ ∈ ◡𝐵 ↔ ⟨𝑧, 𝑦⟩ ∈ 𝐵)
9	8	bicomi 227	. . . 4 ⊢ (⟨𝑧, 𝑦⟩ ∈ 𝐵 ↔ ⟨𝑦, 𝑧⟩ ∈ ◡𝐵)
10	9	rexbii 3118	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ⟨𝑧, 𝑦⟩ ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ ◡𝐵)
11	6, 7	opelcnv 5868	. . . 4 ⊢ (⟨𝑦, 𝑧⟩ ∈ ◡∪ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
12		eliun 4964	. . . 4 ⊢ (⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑧, 𝑦⟩ ∈ 𝐵)
13	11, 12	bitri 278	. . 3 ⊢ (⟨𝑦, 𝑧⟩ ∈ ◡∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑧, 𝑦⟩ ∈ 𝐵)
14		eliun 4964	. . 3 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑦, 𝑧⟩ ∈ ◡𝐵)
15	10, 13, 14	3bitr4i 306	. 2 ⊢ (⟨𝑦, 𝑧⟩ ∈ ◡∪ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐴 ◡𝐵)
16	1, 5, 15	eqrelriiv 5777	1 ⊢ ◡∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 ◡𝐵

Syntax hints:   = wceq 1567   ∈ wcel 2149  ∃wrex 3095  ⟨cop 4600  ∪ ciun 4960  ^◡ccnv 5661  Rel wrel 5667

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-11 2198  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-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-iun 4962  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670

This theorem is referenced by:  cnvtrclfv  44376