| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iindif2 | Structured version Visualization version GIF version | ||
| Description: Indexed intersection of class difference. Generalization of half of theorem "De Morgan's laws" in [Enderton] p. 31. Use uniiun 5028 to recover Enderton's theorem. (Contributed by NM, 5-Oct-2006.) |
| Ref | Expression |
|---|---|
| iindif2 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.28zv 4472 | . . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))) | |
| 2 | eldif 3923 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)) | |
| 3 | 2 | bicomi 227 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 4 | 3 | ralbii 3118 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 5 | ralnex 3098 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 6 | eliun 4965 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 7 | 5, 6 | xchbinxr 338 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶) |
| 8 | 7 | anbi2i 634 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| 9 | 1, 4, 8 | 3bitr3g 316 | . . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))) |
| 10 | eliin 4966 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))) | |
| 11 | 10 | elv 3467 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 12 | eldif 3923 | . . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) | |
| 13 | 9, 11, 12 | 3bitr4g 317 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶))) |
| 14 | 13 | eqrdv 2768 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2150 ≠ wne 2965 ∀wral 3086 ∃wrex 3096 Vcvv 3462 ∖ cdif 3910 ∅c0 4294 ∪ ciun 4961 ∩ ciin 4962 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-12 2220 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ne 2966 df-ral 3087 df-rex 3097 df-v 3464 df-dif 3916 df-nul 4295 df-iun 4963 df-iin 4964 |
| This theorem is referenced by: iinvdif 5051 iincld 23179 clsval2 23190 mretopd 23232 hauscmplem 23546 cmpfi 23548 suppgsumssiun 33362 sigapildsyslem 34521 |
| Copyright terms: Public domain | W3C validator |