![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > iindif2f | Structured version Visualization version GIF version |
Description: Indexed intersection of class difference. Generalization of half of theorem "De Morgan's laws". (Contributed by Glauco Siliprandi, 24-Jan-2025.) |
Ref | Expression |
---|---|
iindif2f.1 | ⊢ Ⅎ𝑥𝐴 |
iindif2f.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
iindif2f | ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iindif2f.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
2 | 1 | nfcri 2889 | . . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵 |
3 | iindif2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
4 | 2, 3 | r19.28zf 44155 | . . . 4 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶))) |
5 | eldif 3958 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶)) | |
6 | 5 | bicomi 223 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ 𝐶)) |
7 | 6 | ralbii 3092 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
8 | ralnex 3071 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
9 | eliun 5001 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
10 | 8, 9 | xchbinxr 335 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶 ↔ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶) |
11 | 10 | anbi2i 622 | . . . 4 ⊢ ((𝑦 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑦 ∈ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) |
12 | 4, 7, 11 | 3bitr3g 313 | . . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))) |
13 | eliin 5002 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶))) | |
14 | 13 | elv 3479 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ (𝐵 ∖ 𝐶)) |
15 | eldif 3958 | . . 3 ⊢ (𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)) | |
16 | 12, 14, 15 | 3bitr4g 314 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) ↔ 𝑦 ∈ (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶))) |
17 | 16 | eqrdv 2729 | 1 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (𝐵 ∖ 𝐶) = (𝐵 ∖ ∪ 𝑥 ∈ 𝐴 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 Ⅎwnfc 2882 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 Vcvv 3473 ∖ cdif 3945 ∅c0 4322 ∪ ciun 4997 ∩ ciin 4998 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-11 2153 ax-12 2170 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-v 3475 df-dif 3951 df-nul 4323 df-iun 4999 df-iin 5000 |
This theorem is referenced by: saliinclf 45341 |
Copyright terms: Public domain | W3C validator |