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

Theorem iinvdif 5040
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 4327 . . . 4 (V ∖ ∅) = V
2 0iun 5021 . . . . 5 ∪ 𝑥 ∈ ∅ 𝐵 = ∅
32difeq2i 4071 . . . 4 (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅)
4 0iin 5022 . . . 4 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V
51, 3, 43eqtr4ri 2795 . . 3 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)
6 iineq1 4969 . . 3 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵))
7 iuneq1 4968 . . . 4 (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵)
87difeq2d 4074 . . 3 (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵))
95, 6, 83eqtr4a 2822 . 2 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
10 iindif2 5037 . 2 (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
119, 10pm2.61ine 3039 1 ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3451   ∖ cdif 3896  ∅c0 4279  ∪ ciun 4951  ∩ ciin 4952
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2213  ax-ext 2733
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-ss 3916  df-nul 4280  df-iun 4953  df-iin 4954
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator