| 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 5254 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) | |
| 2 | elex 3453 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 3 | disjdifprg 32671 | . . 3 ⊢ (((𝐴 ∩ 𝐵) ∈ V ∧ 𝐴 ∈ V) → Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥) | |
| 4 | 1, 2, 3 | syl2anc 590 | . 2 ⊢ (𝐴 ∈ 𝑉 → Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥) |
| 5 | difin 4207 | . . . . 5 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 6 | 5 | preq1i 4675 | . . . 4 ⊢ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)} = {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)} |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)} = {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}) |
| 8 | 7 | disjeq1d 5054 | . 2 ⊢ (𝐴 ∈ 𝑉 → (Disj 𝑥 ∈ {(𝐴 ∖ (𝐴 ∩ 𝐵)), (𝐴 ∩ 𝐵)}𝑥 ↔ Disj 𝑥 ∈ {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}𝑥)) |
| 9 | 4, 8 | mpbid 233 | 1 ⊢ (𝐴 ∈ 𝑉 → Disj 𝑥 ∈ {(𝐴 ∖ 𝐵), (𝐴 ∩ 𝐵)}𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 Vcvv 3432 ∖ cdif 3887 ∩ cin 3889 {cpr 4564 Disj wdisj 5046 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-sn 4563 df-pr 4565 df-disj 5047 |
| This theorem is referenced by: measxun2 34401 |
| Copyright terms: Public domain | W3C validator |