| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjdifprg2 | Structured version Visualization version GIF version | ||
| Description: A trivial partition of a set into its difference and intersection with another set. (Contributed by Thierry Arnoux, 25-Dec-2016.) |
| Ref | Expression |
|---|---|
| disjdifprg2 | ⊢ (𝐴 ∈ 𝑉 → Disj 𝑥 ∈ {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inex1g 5280 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) | |
| 2 | elex 3478 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 3 | disjdifprg 32830 | . . 3 ⊢ (((𝐴 ∩ 𝐵) ∈ V ∧ 𝐴 ∈ V) → Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥) | |
| 4 | 1, 2, 3 | syl2anc 595 | . 2 ⊢ (𝐴 ∈ 𝑉 → Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥) |
| 5 | difin 4227 | . . . . 5 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 6 | 5 | preq1i 4698 | . . . 4 ⊢ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)} = {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)} |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)} = {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}) |
| 8 | 7 | disjeq1d 5080 | . 2 ⊢ (𝐴 ∈ 𝑉 → (Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥 ↔ Disj 𝑥 ∈ {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}𝑥)) |
| 9 | 4, 8 | mpbid 235 | 1 ⊢ (𝐴 ∈ 𝑉 → Disj 𝑥 ∈ {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ∖ cdif 3904 ∩ cin 3906 {cpr 4587 Disj wdisj 5072 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-sn 4586 df-pr 4588 df-disj 5073 |
| This theorem is referenced by: measxun2 34517 |
| Copyright terms: Public domain | W3C validator |