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

Theorem inuni 4975
Description: The intersection of a union 𝐴 with a class 𝐵 is equal to the union of the intersections of each element of 𝐴 with 𝐵. (Contributed by FL, 24-Mar-2007.)
Assertion
Ref Expression
inuni ( 𝐴𝐵) = {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)}
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem inuni
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eluni2 4592 . . . . 5 (𝑧 𝐴 ↔ ∃𝑦𝐴 𝑧𝑦)
21anbi1i 733 . . . 4 ((𝑧 𝐴𝑧𝐵) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
3 elin 3939 . . . 4 (𝑧 ∈ ( 𝐴𝐵) ↔ (𝑧 𝐴𝑧𝐵))
4 ancom 465 . . . . . . . 8 ((𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ (∃𝑦𝐴 𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
5 r19.41v 3227 . . . . . . . 8 (∃𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (∃𝑦𝐴 𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
64, 5bitr4i 267 . . . . . . 7 ((𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
76exbii 1923 . . . . . 6 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑥𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
8 rexcom4 3365 . . . . . 6 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ ∃𝑥𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
97, 8bitr4i 267 . . . . 5 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
10 vex 3343 . . . . . . . . . 10 𝑦 ∈ V
1110inex1 4951 . . . . . . . . 9 (𝑦𝐵) ∈ V
12 eleq2 2828 . . . . . . . . 9 (𝑥 = (𝑦𝐵) → (𝑧𝑥𝑧 ∈ (𝑦𝐵)))
1311, 12ceqsexv 3382 . . . . . . . 8 (∃𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ 𝑧 ∈ (𝑦𝐵))
14 elin 3939 . . . . . . . 8 (𝑧 ∈ (𝑦𝐵) ↔ (𝑧𝑦𝑧𝐵))
1513, 14bitri 264 . . . . . . 7 (∃𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (𝑧𝑦𝑧𝐵))
1615rexbii 3179 . . . . . 6 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ ∃𝑦𝐴 (𝑧𝑦𝑧𝐵))
17 r19.41v 3227 . . . . . 6 (∃𝑦𝐴 (𝑧𝑦𝑧𝐵) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
1816, 17bitri 264 . . . . 5 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
199, 18bitri 264 . . . 4 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
202, 3, 193bitr4i 292 . . 3 (𝑧 ∈ ( 𝐴𝐵) ↔ ∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)))
21 eluniab 4599 . . 3 (𝑧 {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)} ↔ ∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)))
2220, 21bitr4i 267 . 2 (𝑧 ∈ ( 𝐴𝐵) ↔ 𝑧 {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)})
2322eqriv 2757 1 ( 𝐴𝐵) = {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)}
Colors of variables: wff setvar class
Syntax hints:  wa 383   = wceq 1632  wex 1853  wcel 2139  {cab 2746  wrex 3051  cin 3714   cuni 4588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-v 3342  df-in 3722  df-uni 4589
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator