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

Theorem iundif2 5077
Description: Indexed union of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use intiin 5062 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 3958 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
21rexbii 3094 . . . 4 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
3 r19.42v 3190 . . . 4 (∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶))
4 rexnal 3100 . . . . . 6 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ ∀𝑥𝐴 𝑦𝐶)
5 eliin 5002 . . . . . . 7 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
65elv 3480 . . . . . 6 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
74, 6xchbinxr 334 . . . . 5 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ 𝑦 𝑥𝐴 𝐶)
87anbi2i 623 . . . 4 ((𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
92, 3, 83bitri 296 . . 3 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
10 eliun 5001 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐵𝐶))
11 eldif 3958 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
129, 10, 113bitr4i 302 . 2 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶))
1312eqriv 2729 1 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3061  wrex 3070  Vcvv 3474  cdif 3945   ciun 4997   ciin 4998
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-v 3476  df-dif 3951  df-iun 4999  df-iin 5000
This theorem is referenced by:  iuncld  22556  pnrmopn  22854  alexsublem  23555  bcth3  24855  iundifdifd  31831  iundifdif  31832
  Copyright terms: Public domain W3C validator