MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnvuni Structured version   Visualization version   GIF version

Theorem cnvuni 5874
Description: The converse of a class union is the (indexed) union of the converses of its members. (Contributed by NM, 11-Aug-2004.)
Assertion
Ref Expression
cnvuni ◡∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 ◡𝑥
Distinct variable group:   𝑥,𝐴

Proof of Theorem cnvuni
Dummy variables 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elcnv2 5861 . . . 4 (𝑦 ∈ ◡∪ 𝐴 ↔ ∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ ∪ 𝐴))
2 eluni2 4874 . . . . . . 7 (⟨𝑤, 𝑧⟩ ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ⟨𝑤, 𝑧⟩ ∈ 𝑥)
32anbi2i 635 . . . . . 6 ((𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ ∪ 𝐴) ↔ (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ∃𝑥 ∈ 𝐴 ⟨𝑤, 𝑧⟩ ∈ 𝑥))
4 r19.42v 3198 . . . . . 6 (∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥) ↔ (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ∃𝑥 ∈ 𝐴 ⟨𝑤, 𝑧⟩ ∈ 𝑥))
53, 4bitr4i 281 . . . . 5 ((𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ ∪ 𝐴) ↔ ∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
652exbii 1882 . . . 4 (∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ ∪ 𝐴) ↔ ∃𝑧∃𝑤∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
7 elcnv2 5861 . . . . . 6 (𝑦 ∈ ◡𝑥 ↔ ∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
87rexbii 3113 . . . . 5 (∃𝑥 ∈ 𝐴 𝑦 ∈ ◡𝑥 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
9 rexcom4 3293 . . . . 5 (∃𝑥 ∈ 𝐴 ∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥) ↔ ∃𝑧∃𝑥 ∈ 𝐴 ∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
10 rexcom4 3293 . . . . . 6 (∃𝑥 ∈ 𝐴 ∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥) ↔ ∃𝑤∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
1110exbii 1881 . . . . 5 (∃𝑧∃𝑥 ∈ 𝐴 ∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥) ↔ ∃𝑧∃𝑤∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥))
128, 9, 113bitrri 301 . . . 4 (∃𝑧∃𝑤∃𝑥 ∈ 𝐴 (𝑦 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑤, 𝑧⟩ ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ◡𝑥)
131, 6, 123bitri 300 . . 3 (𝑦 ∈ ◡∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ◡𝑥)
14 eliun 4958 . . 3 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ◡𝑥 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ ◡𝑥)
1513, 14bitr4i 281 . 2 (𝑦 ∈ ◡∪ 𝐴 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 ◡𝑥)
1615eqriv 2760 1 ◡∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 ◡𝑥
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090  ⟨cop 4838  ∪ cuni 4870  ∪ ciun 4954  ◡ccnv 5654
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  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 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-cnv 5663
This theorem is used by:  funcnvuni  7965
  Copyright terms: Public domain W3C validator