| 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 2216. (Revised by GG, 28-Jun-2024.) |
| Ref | Expression |
|---|---|
| reldisj | ⊢ (𝐴 ⊆ 𝐶 → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (𝐶 ∖ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ss 3925 | . . . 4 ⊢ (𝐴 ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶)) | |
| 2 | eleq1w 2849 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 3 | eleq1w 2849 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐶 ↔ 𝑦 ∈ 𝐶)) | |
| 4 | 2, 3 | imbi12d 347 | . . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) ↔ (𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐶))) |
| 5 | 4 | spw 2067 | . . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶)) |
| 6 | pm5.44 552 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))) | |
| 7 | eldif 3918 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐶 ∖ 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)) | |
| 8 | 7 | imbi2i 339 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵))) |
| 9 | 6, 8 | bitr4di 292 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 10 | 5, 9 | syl 18 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 11 | 1, 10 | sylbi 220 | . . 3 ⊢ (𝐴 ⊆ 𝐶 → ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 12 | 11 | albidv 1953 | . 2 ⊢ (𝐴 ⊆ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵)))) |
| 13 | disj1 4415 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)) | |
| 14 | df-ss 3925 | . 2 ⊢ (𝐴 ⊆ (𝐶 ∖ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐶 ∖ 𝐵))) | |
| 15 | 12, 13, 14 | 3bitr4g 317 | 1 ⊢ (𝐴 ⊆ 𝐶 → ((𝐴 ∩ 𝐵) = ∅ ↔ 𝐴 ⊆ (𝐶 ∖ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 = wceq 1570 ∈ wcel 2146 ∖ cdif 3905 ∩ cin 3907 ⊆ wss 3908 ∅c0 4289 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-v 3460 df-dif 3911 df-in 3915 df-ss 3925 df-nul 4290 |
| This theorem is used by: disj2 4421 ssdifsn 4761 oacomf1olem 8558 domdifsn 9058 elfiun 9400 cantnfp1lem3 9659 ssxr 11297 structcnvcnv 17238 fidomndrng 20914 ssdifidlprm 21523 elcls 23267 ist1-2 23541 nrmsep2 23550 nrmsep 23551 isnrm3 23553 isreg2 23571 hauscmplem 23600 connsub 23615 iunconnlem 23621 llycmpkgen2 23744 hausdiag 23839 trfil3 24082 isufil2 24102 filufint 24114 blcld 24699 i1fima2 25875 i1fd 25877 nbgrssvwo2 29749 pliguhgr 30875 symgcom2 33435 inunissunidif 38062 poimirlem15 38327 itg2addnclem2 38364 ntrk0kbimka 44806 ntrneicls11 44857 gneispace 44901 opndisj 49722 seposep 49745 |
| Copyright terms: Public domain | W3C validator |