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

Theorem iindif1 5098
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 4529 . . . 4 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶)))
2 eldif 3986 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
32ralbii 3099 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
4 eliin 5020 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
54elv 3493 . . . . 5 (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵)
65anbi1i 623 . . . 4 ((𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶))
71, 3, 63bitr4g 314 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶)))
8 eliin 5020 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3493 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 eldif 3986 . . 3 (𝑦 ∈ ( 𝑥𝐴 𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶))
117, 9, 103bitr4g 314 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ ( 𝑥𝐴 𝐵𝐶)))
1211eqrdv 2738 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = ( 𝑥𝐴 𝐵𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wne 2946  wral 3067  Vcvv 3488  cdif 3973  c0 4352   ciin 5016
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-v 3490  df-dif 3979  df-nul 4353  df-iin 5018
This theorem is referenced by:  subdrgint  20826
  Copyright terms: Public domain W3C validator