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

Theorem iundif2 5078
Description: Indexed union of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use intiin 5063 to recover Enderton's theorem. (Contributed by NM, 19-Aug-2004.)
Assertion
Ref Expression
iundif2 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Distinct variable group:   𝑥,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐶(𝑥)

Proof of Theorem iundif2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eldif 3959 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
21rexbii 3095 . . . 4 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
3 r19.42v 3191 . . . 4 (∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶))
4 rexnal 3101 . . . . . 6 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ ∀𝑥𝐴 𝑦𝐶)
5 eliin 5003 . . . . . . 7 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
65elv 3481 . . . . . 6 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
74, 6xchbinxr 335 . . . . 5 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ 𝑦 𝑥𝐴 𝐶)
87anbi2i 624 . . . 4 ((𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
92, 3, 83bitri 297 . . 3 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
10 eliun 5002 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐵𝐶))
11 eldif 3959 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
129, 10, 113bitr4i 303 . 2 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶))
1312eqriv 2730 1 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 397   = wceq 1542  wcel 2107  wral 3062  wrex 3071  Vcvv 3475  cdif 3946   ciun 4998   ciin 4999
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-v 3477  df-dif 3952  df-iun 5000  df-iin 5001
This theorem is referenced by:  iuncld  22549  pnrmopn  22847  alexsublem  23548  bcth3  24848  iundifdifd  31793  iundifdif  31794
  Copyright terms: Public domain W3C validator