| 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 5018 to recover Enderton's theorem. (Contributed by NM, 5-Oct-2006.) |
| Ref | Expression |
|---|---|
| iindif2 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.28zv 4462 | . . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))) | |
| 2 | eldif 3916 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)) | |
| 3 | 2 | bicomi 226 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 4 | 3 | ralbii 3110 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 5 | ralnex 3090 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 6 | eliun 4955 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 7 | 5, 6 | xchbinxr 337 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶) |
| 8 | 7 | anbi2i 632 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| 9 | 1, 4, 8 | 3bitr3g 315 | . . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))) |
| 10 | eliin 4956 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))) | |
| 11 | 10 | elv 3461 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
| 12 | eldif 3916 | . . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) | |
| 13 | 9, 11, 12 | 3bitr4g 316 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶))) |
| 14 | 13 | eqrdv 2762 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ≠ wne 2959 ∀wral 3078 ∃wrex 3088 Vcvv 3456 ∖ cdif 3903 ∅c0 4287 ∪ ciun 4951 ∩ ciin 4952 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-12 2214 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-v 3458 df-dif 3909 df-nul 4288 df-iun 4953 df-iin 4954 |
| This theorem is referenced by: iinvdif 5039 iincld 23101 clsval2 23112 mretopd 23154 hauscmplem 23468 cmpfi 23470 suppgsumssiun 33254 sigapildsyslem 34460 |
| Copyright terms: Public domain | W3C validator |