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 44652
Description: Composition with an indexed union. Proof analogous to that of coiun 6258. (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 6103 . 2 Rel (∪ 𝑥 ∈ 𝐶 𝐴 ∘ 𝐵)
2 reliun 5793 . . 3 (Rel ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵) ↔ ∀𝑥 ∈ 𝐶 Rel (𝐴 ∘ 𝐵))
3 relco 6103 . . . 4 Rel (𝐴 ∘ 𝐵)
43a1i 11 . . 3 (𝑥 ∈ 𝐶 → Rel (𝐴 ∘ 𝐵))
52, 4mprgbir 3083 . 2 Rel ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵)
6 eliun 4954 . . . . . . . 8 (⟨𝑤, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐶 𝐴 ↔ ∃𝑥 ∈ 𝐶 ⟨𝑤, 𝑧⟩ ∈ 𝐴)
7 df-br 5103 . . . . . . . 8 (𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧 ↔ ⟨𝑤, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐶 𝐴)
8 df-br 5103 . . . . . . . . 9 (𝑤𝐴𝑧 ↔ ⟨𝑤, 𝑧⟩ ∈ 𝐴)
98rexbii 3109 . . . . . . . 8 (∃𝑥 ∈ 𝐶 𝑤𝐴𝑧 ↔ ∃𝑥 ∈ 𝐶 ⟨𝑤, 𝑧⟩ ∈ 𝐴)
106, 7, 93bitr4i 306 . . . . . . 7 (𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧 ↔ ∃𝑥 ∈ 𝐶 𝑤𝐴𝑧)
1110anbi2i 635 . . . . . 6 ((𝑦𝐵𝑤 ∧ 𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧) ↔ (𝑦𝐵𝑤 ∧ ∃𝑥 ∈ 𝐶 𝑤𝐴𝑧))
12 r19.42v 3194 . . . . . 6 (∃𝑥 ∈ 𝐶 (𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧) ↔ (𝑦𝐵𝑤 ∧ ∃𝑥 ∈ 𝐶 𝑤𝐴𝑧))
1311, 12bitr4i 281 . . . . 5 ((𝑦𝐵𝑤 ∧ 𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧) ↔ ∃𝑥 ∈ 𝐶 (𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
1413exbii 1880 . . . 4 (∃𝑤(𝑦𝐵𝑤 ∧ 𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧) ↔ ∃𝑤∃𝑥 ∈ 𝐶 (𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
15 rexcom4 3289 . . . 4 (∃𝑥 ∈ 𝐶 ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧) ↔ ∃𝑤∃𝑥 ∈ 𝐶 (𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
1614, 15bitr4i 281 . . 3 (∃𝑤(𝑦𝐵𝑤 ∧ 𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧) ↔ ∃𝑥 ∈ 𝐶 ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
17 vex 3454 . . . 4 𝑦 ∈ V
18 vex 3454 . . . 4 𝑧 ∈ V
1917, 18opelco 5848 . . 3 (⟨𝑦, 𝑧⟩ ∈ (∪ 𝑥 ∈ 𝐶 𝐴 ∘ 𝐵) ↔ ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤∪ 𝑥 ∈ 𝐶 𝐴𝑧))
20 eliun 4954 . . . 4 (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵) ↔ ∃𝑥 ∈ 𝐶 ⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵))
2117, 18opelco 5848 . . . . 5 (⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
2221rexbii 3109 . . . 4 (∃𝑥 ∈ 𝐶 ⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑥 ∈ 𝐶 ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
2320, 22bitri 278 . . 3 (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵) ↔ ∃𝑥 ∈ 𝐶 ∃𝑤(𝑦𝐵𝑤 ∧ 𝑤𝐴𝑧))
2416, 19, 233bitr4i 306 . 2 (⟨𝑦, 𝑧⟩ ∈ (∪ 𝑥 ∈ 𝐶 𝐴 ∘ 𝐵) ↔ ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵))
251, 5, 24eqrelriiv 5765 1 (∪ 𝑥 ∈ 𝐶 𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ 𝐶 (𝐴 ∘ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086  ⟨cop 4589  ∪ ciun 4950   class class class wbr 5102   ∘ ccom 5654  Rel wrel 5655
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5390
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-iun 4952  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-co 5659
This theorem is used by:  trclfvcom  44723  trclfvdecomr  44728  cotrclrcl  44742
  Copyright terms: Public domain W3C validator