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

Theorem iindif1 5035
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 4467 . . . 4 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶)))
2 eldif 3909 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
32ralbii 3108 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
4 eliin 4956 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
54elv 3455 . . . . 5 (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵)
65anbi1i 636 . . . 4 ((𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶) ↔ (∀𝑥𝐴 𝑦𝐵 ∧ ¬ 𝑦𝐶))
71, 3, 63bitr4g 317 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶)))
8 eliin 4956 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3455 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 eldif 3909 . . 3 (𝑦 ∈ ( 𝑥𝐴 𝐵𝐶) ↔ (𝑦 𝑥𝐴 𝐵 ∧ ¬ 𝑦𝐶))
117, 9, 103bitr4g 317 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ ( 𝑥𝐴 𝐵𝐶)))
1211eqrdv 2758 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = ( 𝑥𝐴 𝐵𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wne 2955  wral 3076  Vcvv 3450  cdif 3896  c0 4279   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 2732
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 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-v 3452  df-dif 3902  df-nul 4280  df-iin 4954
This theorem is used by:  subdrgint  20970
  Copyright terms: Public domain W3C validator