Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  inuni GIF version

Theorem inuni 3909
 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 3584 . . . . 5 (𝑧 𝐴 ↔ ∃𝑦𝐴 𝑧𝑦)
21anbi1i 431 . . . 4 ((𝑧 𝐴𝑧𝐵) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
3 elin 3126 . . . 4 (𝑧 ∈ ( 𝐴𝐵) ↔ (𝑧 𝐴𝑧𝐵))
4 ancom 253 . . . . . . . 8 ((𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ (∃𝑦𝐴 𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
5 r19.41v 2466 . . . . . . . 8 (∃𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (∃𝑦𝐴 𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
64, 5bitr4i 176 . . . . . . 7 ((𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
76exbii 1496 . . . . . 6 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑥𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
8 rexcom4 2577 . . . . . 6 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ ∃𝑥𝑦𝐴 (𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
97, 8bitr4i 176 . . . . 5 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ ∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥))
10 vex 2560 . . . . . . . . . 10 𝑦 ∈ V
1110inex1 3891 . . . . . . . . 9 (𝑦𝐵) ∈ V
12 eleq2 2101 . . . . . . . . 9 (𝑥 = (𝑦𝐵) → (𝑧𝑥𝑧 ∈ (𝑦𝐵)))
1311, 12ceqsexv 2593 . . . . . . . 8 (∃𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ 𝑧 ∈ (𝑦𝐵))
14 elin 3126 . . . . . . . 8 (𝑧 ∈ (𝑦𝐵) ↔ (𝑧𝑦𝑧𝐵))
1513, 14bitri 173 . . . . . . 7 (∃𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (𝑧𝑦𝑧𝐵))
1615rexbii 2331 . . . . . 6 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ ∃𝑦𝐴 (𝑧𝑦𝑧𝐵))
17 r19.41v 2466 . . . . . 6 (∃𝑦𝐴 (𝑧𝑦𝑧𝐵) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
1816, 17bitri 173 . . . . 5 (∃𝑦𝐴𝑥(𝑥 = (𝑦𝐵) ∧ 𝑧𝑥) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
199, 18bitri 173 . . . 4 (∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)) ↔ (∃𝑦𝐴 𝑧𝑦𝑧𝐵))
202, 3, 193bitr4i 201 . . 3 (𝑧 ∈ ( 𝐴𝐵) ↔ ∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)))
21 eluniab 3592 . . 3 (𝑧 {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)} ↔ ∃𝑥(𝑧𝑥 ∧ ∃𝑦𝐴 𝑥 = (𝑦𝐵)))
2220, 21bitr4i 176 . 2 (𝑧 ∈ ( 𝐴𝐵) ↔ 𝑧 {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)})
2322eqriv 2037 1 ( 𝐴𝐵) = {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)}
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   = wceq 1243  ∃wex 1381   ∈ wcel 1393  {cab 2026  ∃wrex 2307   ∩ cin 2916  ∪ cuni 3580 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875 This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-in 2924  df-uni 3581 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator