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 4988 to recover Enderton's theorem. (Contributed by NM, 5-Oct-2006.) |
Ref | Expression |
---|---|
iindif2 | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.28zv 4431 | . . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))) | |
2 | eldif 3897 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)) | |
3 | 2 | bicomi 223 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ 𝐶)) |
4 | 3 | ralbii 3092 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
5 | ralnex 3167 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
6 | eliun 4928 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
7 | 5, 6 | xchbinxr 335 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶) |
8 | 7 | anbi2i 623 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) |
9 | 1, 4, 8 | 3bitr3g 313 | . . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))) |
10 | eliin 4929 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))) | |
11 | 10 | elv 3438 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
12 | eldif 3897 | . . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) | |
13 | 9, 11, 12 | 3bitr4g 314 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶))) |
14 | 13 | eqrdv 2736 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 Vcvv 3432 ∖ cdif 3884 ∅c0 4256 ∪ ciun 4924 ∩ ciin 4925 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-v 3434 df-dif 3890 df-nul 4257 df-iun 4926 df-iin 4927 |
This theorem is referenced by: iinvdif 5009 iincld 22190 clsval2 22201 mretopd 22243 hauscmplem 22557 cmpfi 22559 sigapildsyslem 32129 saliincl 43866 |
Copyright terms: Public domain | W3C validator |