Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iindif2f Structured version   Visualization version   GIF version

Theorem iindif2f 46174
Description: Indexed intersection of class difference. Generalization of half of theorem "De Morgan's laws". (Contributed by Glauco Siliprandi, 24-Jan-2025.)
Hypotheses
Ref Expression
iindif2f.1 Ⅎ𝑥𝐴
iindif2f.2 Ⅎ𝑥𝐵
Assertion
Ref Expression
iindif2f (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶))

Proof of Theorem iindif2f
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 iindif2f.2 . . . . . 6 Ⅎ𝑥𝐵
21nfcri 2915 . . . . 5 Ⅎ𝑥 𝑦 ∈ 𝐵
3 iindif2f.1 . . . . 5 Ⅎ𝑥𝐴
42, 3r19.28zf 46173 . . . 4 (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶)))
5 eldif 3909 . . . . . 6 (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶))
65bicomi 227 . . . . 5 ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ 𝐶))
76ralbii 3109 . . . 4 (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
8 ralnex 3089 . . . . . 6 (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
9 eliun 4955 . . . . . 6 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
108, 9xchbinxr 338 . . . . 5 (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)
1110anbi2i 635 . . . 4 ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))
124, 7, 113bitr3g 316 . . 3 (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)))
13 eliin 4956 . . . 4 (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)))
1413elv 3456 . . 3 (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))
15 eldif 3909 . . 3 (𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))
1612, 14, 153bitr4g 317 . 2 (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)))
1716eqrdv 2759 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  Ⅎwnfc 2908   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  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-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-v 3453  df-dif 3902  df-nul 4280  df-iun 4953  df-iin 4954
This theorem is used by:  saliinclf  47335
  Copyright terms: Public domain W3C validator