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

Theorem iundif2 4982
Description: Indexed union of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use intiin 4968 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 3876 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦𝐶))
21rexbii 3170 . . . 4 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶))
3 r19.42v 3263 . . . 4 (∃𝑥𝐴 (𝑦𝐵 ∧ ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶))
4 rexnal 3160 . . . . . 6 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ ∀𝑥𝐴 𝑦𝐶)
5 eliin 4909 . . . . . . 7 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
65elv 3414 . . . . . 6 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
74, 6xchbinxr 338 . . . . 5 (∃𝑥𝐴 ¬ 𝑦𝐶 ↔ ¬ 𝑦 𝑥𝐴 𝐶)
87anbi2i 626 . . . 4 ((𝑦𝐵 ∧ ∃𝑥𝐴 ¬ 𝑦𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
92, 3, 83bitri 300 . . 3 (∃𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
10 eliun 4908 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐵𝐶))
11 eldif 3876 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ¬ 𝑦 𝑥𝐴 𝐶))
129, 10, 113bitr4i 306 . 2 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶))
1312eqriv 2734 1 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wa 399   = wceq 1543  wcel 2110  wral 3061  wrex 3062  Vcvv 3408  cdif 3863   ciun 4904   ciin 4905
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-ext 2708
This theorem depends on definitions:  df-bi 210  df-an 400  df-tru 1546  df-ex 1788  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3066  df-rex 3067  df-v 3410  df-dif 3869  df-iun 4906  df-iin 4907
This theorem is referenced by:  iuncld  21942  pnrmopn  22240  alexsublem  22941  bcth3  24228  iundifdifd  30620  iundifdif  30621
  Copyright terms: Public domain W3C validator