Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  coiun1 Structured version   Visualization version   GIF version

Theorem coiun1 43623
Description: Composition with an indexed union. Proof analogous to that of coiun 6245. (Contributed by RP, 20-Jun-2020.)
Assertion
Ref Expression
coiun1 ( 𝑥𝐶 𝐴𝐵) = 𝑥𝐶 (𝐴𝐵)
Distinct variable group:   𝑥,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐶(𝑥)

Proof of Theorem coiun1
Dummy variables 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relco 6095 . 2 Rel ( 𝑥𝐶 𝐴𝐵)
2 reliun 5795 . . 3 (Rel 𝑥𝐶 (𝐴𝐵) ↔ ∀𝑥𝐶 Rel (𝐴𝐵))
3 relco 6095 . . . 4 Rel (𝐴𝐵)
43a1i 11 . . 3 (𝑥𝐶 → Rel (𝐴𝐵))
52, 4mprgbir 3058 . 2 Rel 𝑥𝐶 (𝐴𝐵)
6 eliun 4971 . . . . . . . 8 (⟨𝑤, 𝑧⟩ ∈ 𝑥𝐶 𝐴 ↔ ∃𝑥𝐶𝑤, 𝑧⟩ ∈ 𝐴)
7 df-br 5120 . . . . . . . 8 (𝑤 𝑥𝐶 𝐴𝑧 ↔ ⟨𝑤, 𝑧⟩ ∈ 𝑥𝐶 𝐴)
8 df-br 5120 . . . . . . . . 9 (𝑤𝐴𝑧 ↔ ⟨𝑤, 𝑧⟩ ∈ 𝐴)
98rexbii 3083 . . . . . . . 8 (∃𝑥𝐶 𝑤𝐴𝑧 ↔ ∃𝑥𝐶𝑤, 𝑧⟩ ∈ 𝐴)
106, 7, 93bitr4i 303 . . . . . . 7 (𝑤 𝑥𝐶 𝐴𝑧 ↔ ∃𝑥𝐶 𝑤𝐴𝑧)
1110anbi2i 623 . . . . . 6 ((𝑦𝐵𝑤𝑤 𝑥𝐶 𝐴𝑧) ↔ (𝑦𝐵𝑤 ∧ ∃𝑥𝐶 𝑤𝐴𝑧))
12 r19.42v 3176 . . . . . 6 (∃𝑥𝐶 (𝑦𝐵𝑤𝑤𝐴𝑧) ↔ (𝑦𝐵𝑤 ∧ ∃𝑥𝐶 𝑤𝐴𝑧))
1311, 12bitr4i 278 . . . . 5 ((𝑦𝐵𝑤𝑤 𝑥𝐶 𝐴𝑧) ↔ ∃𝑥𝐶 (𝑦𝐵𝑤𝑤𝐴𝑧))
1413exbii 1848 . . . 4 (∃𝑤(𝑦𝐵𝑤𝑤 𝑥𝐶 𝐴𝑧) ↔ ∃𝑤𝑥𝐶 (𝑦𝐵𝑤𝑤𝐴𝑧))
15 rexcom4 3269 . . . 4 (∃𝑥𝐶𝑤(𝑦𝐵𝑤𝑤𝐴𝑧) ↔ ∃𝑤𝑥𝐶 (𝑦𝐵𝑤𝑤𝐴𝑧))
1614, 15bitr4i 278 . . 3 (∃𝑤(𝑦𝐵𝑤𝑤 𝑥𝐶 𝐴𝑧) ↔ ∃𝑥𝐶𝑤(𝑦𝐵𝑤𝑤𝐴𝑧))
17 vex 3463 . . . 4 𝑦 ∈ V
18 vex 3463 . . . 4 𝑧 ∈ V
1917, 18opelco 5851 . . 3 (⟨𝑦, 𝑧⟩ ∈ ( 𝑥𝐶 𝐴𝐵) ↔ ∃𝑤(𝑦𝐵𝑤𝑤 𝑥𝐶 𝐴𝑧))
20 eliun 4971 . . . 4 (⟨𝑦, 𝑧⟩ ∈ 𝑥𝐶 (𝐴𝐵) ↔ ∃𝑥𝐶𝑦, 𝑧⟩ ∈ (𝐴𝐵))
2117, 18opelco 5851 . . . . 5 (⟨𝑦, 𝑧⟩ ∈ (𝐴𝐵) ↔ ∃𝑤(𝑦𝐵𝑤𝑤𝐴𝑧))
2221rexbii 3083 . . . 4 (∃𝑥𝐶𝑦, 𝑧⟩ ∈ (𝐴𝐵) ↔ ∃𝑥𝐶𝑤(𝑦𝐵𝑤𝑤𝐴𝑧))
2320, 22bitri 275 . . 3 (⟨𝑦, 𝑧⟩ ∈ 𝑥𝐶 (𝐴𝐵) ↔ ∃𝑥𝐶𝑤(𝑦𝐵𝑤𝑤𝐴𝑧))
2416, 19, 233bitr4i 303 . 2 (⟨𝑦, 𝑧⟩ ∈ ( 𝑥𝐶 𝐴𝐵) ↔ ⟨𝑦, 𝑧⟩ ∈ 𝑥𝐶 (𝐴𝐵))
251, 5, 24eqrelriiv 5769 1 ( 𝑥𝐶 𝐴𝐵) = 𝑥𝐶 (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1540  wex 1779  wcel 2108  wrex 3060  cop 4607   ciun 4967   class class class wbr 5119  ccom 5658  Rel wrel 5659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-iun 4969  df-br 5120  df-opab 5182  df-xp 5660  df-rel 5661  df-co 5663
This theorem is referenced by:  trclfvcom  43694  trclfvdecomr  43699  cotrclrcl  43713
  Copyright terms: Public domain W3C validator