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

Theorem iindif1 4997
Description: Indexed intersection of class difference with the subtrahend held constant. (Contributed by Thierry Arnoux, 21-Aug-2023.)
Assertion
Ref Expression
iindif1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = ( 𝑥𝐴 𝐵𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iindif1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 r19.27zv 4451 . . . 4 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶)))
2 eldif 3946 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
32ralbii 3165 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
4 eliin 4924 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
54elv 3499 . . . . 5 (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵)
65anbi1i 625 . . . 4 ((𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶))
71, 3, 63bitr4g 316 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶)))
8 eliin 4924 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3499 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 eldif 3946 . . 3 (𝑦 ∈ ( 𝑥𝐴 𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶))
117, 9, 103bitr4g 316 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ ( 𝑥𝐴 𝐵𝐶)))
1211eqrdv 2819 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = ( 𝑥𝐴 𝐵𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wne 3016  wral 3138  Vcvv 3494  cdif 3933  c0 4291   ciin 4920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-v 3496  df-dif 3939  df-nul 4292  df-iin 4922
This theorem is referenced by:  subdrgint  19582
  Copyright terms: Public domain W3C validator