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

Theorem iinvdif 5045
Description: The indexed intersection of a complement. (Contributed by Gérard Lang, 5-Aug-2018.)
Assertion
Ref Expression
iinvdif ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iinvdif
StepHypRef Expression
1 dif0 4330 . . . 4 (V ∖ ∅) = V
2 0iun 5026 . . . . 5 ∪ 𝑥 ∈ ∅ 𝐵 = ∅
32difeq2i 4063 . . . 4 (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅)
4 0iin 5027 . . . 4 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V
51, 3, 43eqtr4ri 2797 . . 3 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)
6 iineq1 4974 . . 3 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵))
7 iuneq1 4973 . . . 4 (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵)
87difeq2d 4066 . . 3 (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵))
95, 6, 83eqtr4a 2824 . 2 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
10 iindif2 5042 . 2 (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
119, 10pm2.61ine 3042 1 ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3454   ∖ cdif 4048  ∅c0 4281  ∪ ciun 4956  ∩ ciin 4957
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-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-nul 4282  df-iun 4958  df-iin 4959
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator