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

Theorem iinvdif 5039
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 4326 . . . 4 (V ∖ ∅) = V
2 0iun 5020 . . . . 5 ∪ 𝑥 ∈ ∅ 𝐵 = ∅
32difeq2i 4059 . . . 4 (V ∖ ∪ 𝑥 ∈ ∅ 𝐵) = (V ∖ ∅)
4 0iin 5021 . . . 4 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = V
51, 3, 43eqtr4ri 2794 . . 3 ∩ 𝑥 ∈ ∅ (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵)
6 iineq1 4968 . . 3 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = ∩ 𝑥 ∈ ∅ (V ∖ 𝐵))
7 iuneq1 4967 . . . 4 (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ ∅ 𝐵)
87difeq2d 4062 . . 3 (𝐴 = ∅ → (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵) = (V ∖ ∪ 𝑥 ∈ ∅ 𝐵))
95, 6, 83eqtr4a 2821 . 2 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
10 iindif2 5036 . 2 (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵))
119, 10pm2.61ine 3038 1 ∩ 𝑥 ∈ 𝐴 (V ∖ 𝐵) = (V ∖ ∪ 𝑥 ∈ 𝐴 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  Vcvv 3450   ∖ cdif 4044  ∅c0 4277  ∪ ciun 4950  ∩ ciin 4951
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-nul 4278  df-iun 4952  df-iin 4953
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator