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

Theorem iununi 5021
Description: A relationship involving union and indexed union. Exercise 25 of [Enderton] p. 33. (Contributed by NM, 25-Nov-2003.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
Assertion
Ref Expression
iununi ((𝐵 = ∅ → 𝐴 = ∅) ↔ (𝐴 𝐵) = 𝑥𝐵 (𝐴𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem iununi
StepHypRef Expression
1 df-ne 3017 . . . . . . 7 (𝐵 ≠ ∅ ↔ ¬ 𝐵 = ∅)
2 iunconst 4928 . . . . . . 7 (𝐵 ≠ ∅ → 𝑥𝐵 𝐴 = 𝐴)
31, 2sylbir 237 . . . . . 6 𝐵 = ∅ → 𝑥𝐵 𝐴 = 𝐴)
4 iun0 4985 . . . . . . 7 𝑥𝐵 ∅ = ∅
5 id 22 . . . . . . . 8 (𝐴 = ∅ → 𝐴 = ∅)
65iuneq2d 4948 . . . . . . 7 (𝐴 = ∅ → 𝑥𝐵 𝐴 = 𝑥𝐵 ∅)
74, 6, 53eqtr4a 2882 . . . . . 6 (𝐴 = ∅ → 𝑥𝐵 𝐴 = 𝐴)
83, 7ja 188 . . . . 5 ((𝐵 = ∅ → 𝐴 = ∅) → 𝑥𝐵 𝐴 = 𝐴)
98eqcomd 2827 . . . 4 ((𝐵 = ∅ → 𝐴 = ∅) → 𝐴 = 𝑥𝐵 𝐴)
109uneq1d 4138 . . 3 ((𝐵 = ∅ → 𝐴 = ∅) → (𝐴 𝑥𝐵 𝑥) = ( 𝑥𝐵 𝐴 𝑥𝐵 𝑥))
11 uniiun 4982 . . . 4 𝐵 = 𝑥𝐵 𝑥
1211uneq2i 4136 . . 3 (𝐴 𝐵) = (𝐴 𝑥𝐵 𝑥)
13 iunun 5015 . . 3 𝑥𝐵 (𝐴𝑥) = ( 𝑥𝐵 𝐴 𝑥𝐵 𝑥)
1410, 12, 133eqtr4g 2881 . 2 ((𝐵 = ∅ → 𝐴 = ∅) → (𝐴 𝐵) = 𝑥𝐵 (𝐴𝑥))
15 unieq 4849 . . . . . . 7 (𝐵 = ∅ → 𝐵 = ∅)
16 uni0 4866 . . . . . . 7 ∅ = ∅
1715, 16syl6eq 2872 . . . . . 6 (𝐵 = ∅ → 𝐵 = ∅)
1817uneq2d 4139 . . . . 5 (𝐵 = ∅ → (𝐴 𝐵) = (𝐴 ∪ ∅))
19 un0 4344 . . . . 5 (𝐴 ∪ ∅) = 𝐴
2018, 19syl6eq 2872 . . . 4 (𝐵 = ∅ → (𝐴 𝐵) = 𝐴)
21 iuneq1 4935 . . . . 5 (𝐵 = ∅ → 𝑥𝐵 (𝐴𝑥) = 𝑥 ∈ ∅ (𝐴𝑥))
22 0iun 4986 . . . . 5 𝑥 ∈ ∅ (𝐴𝑥) = ∅
2321, 22syl6eq 2872 . . . 4 (𝐵 = ∅ → 𝑥𝐵 (𝐴𝑥) = ∅)
2420, 23eqeq12d 2837 . . 3 (𝐵 = ∅ → ((𝐴 𝐵) = 𝑥𝐵 (𝐴𝑥) ↔ 𝐴 = ∅))
2524biimpcd 251 . 2 ((𝐴 𝐵) = 𝑥𝐵 (𝐴𝑥) → (𝐵 = ∅ → 𝐴 = ∅))
2614, 25impbii 211 1 ((𝐵 = ∅ → 𝐴 = ∅) ↔ (𝐴 𝐵) = 𝑥𝐵 (𝐴𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208   = wceq 1537  wne 3016  cun 3934  c0 4291   cuni 4838   ciun 4919
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-sn 4568  df-uni 4839  df-iun 4921
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator