| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reldisj | Structured version Visualization version GIF version | ||
| Description: Two ways of saying that two classes are disjoint, using the complement of 𝐵 relative to a universe 𝐶. (Contributed by NM, 15-Feb-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) Avoid ax-12 2189. (Revised by GG, 28-Jun-2024.) |
| Ref | Expression |
|---|---|
| reldisj | ⊢ (𝐴 ⊆ 𝐶 → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (𝐶 ∖ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ss 3907 | . . . 4 ⊢ (𝐴 ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶)) | |
| 2 | eleq1w 2823 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 3 | eleq1w 2823 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐶 ↔ 𝑦 ∈ 𝐶)) | |
| 4 | 2, 3 | imbi12d 345 | . . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐶))) |
| 5 | 4 | spw 2041 | . . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶)) |
| 6 | pm5.44 547 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))) | |
| 7 | eldif 3900 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐶 ∖ 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) | |
| 8 | 7 | imbi2i 337 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵))) |
| 9 | 6, 8 | bitr4di 290 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 10 | 5, 9 | syl 17 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 11 | 1, 10 | sylbi 218 | . . 3 ⊢ (𝐴 ⊆ 𝐶 → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 12 | 11 | albidv 1927 | . 2 ⊢ (𝐴 ⊆ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 13 | disj1 4387 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)) | |
| 14 | df-ss 3907 | . 2 ⊢ (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵))) | |
| 15 | 12, 13, 14 | 3bitr4g 315 | 1 ⊢ (𝐴 ⊆ 𝐶 → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (𝐶 ∖ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1545 = wceq 1547 ∈ wcel 2119 ∖ cdif 3887 ∩ cin 3889 ⊆ wss 3890 ∅c0 4268 |
| 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-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-v 3434 df-dif 3893 df-in 3897 df-ss 3907 df-nul 4269 |
| This theorem is referenced by: disj2 4393 ssdifsn 4728 oacomf1olem 8496 domdifsn 8995 elfiun 9340 cantnfp1lem3 9599 ssxr 11213 structcnvcnv 17121 fidomndrng 20752 elcls 23063 ist1-2 23337 nrmsep2 23346 nrmsep 23347 isnrm3 23349 isreg2 23367 hauscmplem 23396 connsub 23411 iunconnlem 23417 llycmpkgen2 23540 hausdiag 23635 trfil3 23878 isufil2 23898 filufint 23910 blcld 24495 i1fima2 25671 i1fd 25673 nbgrssvwo2 29456 pliguhgr 30582 symgcom2 33172 ssdifidlprm 33548 inunissunidif 37744 poimirlem15 38009 itg2addnclem2 38046 ntrk0kbimka 44490 ntrneicls11 44541 gneispace 44585 opndisj 49400 seposep 49423 |
| Copyright terms: Public domain | W3C validator |