![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > disjpss | Structured version Visualization version GIF version |
Description: A class is a proper subset of its union with a disjoint nonempty class. (Contributed by NM, 15-Sep-2004.) |
Ref | Expression |
---|---|
disjpss | ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐵 ≠ ∅) → 𝐴 ⊊ (𝐴 ∪ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssid 3842 | . . . . . . . 8 ⊢ 𝐵 ⊆ 𝐵 | |
2 | 1 | biantru 525 | . . . . . . 7 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝐵)) |
3 | ssin 4055 | . . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝐵) ↔ 𝐵 ⊆ (𝐴 ∩ 𝐵)) | |
4 | 2, 3 | bitri 267 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ (𝐴 ∩ 𝐵)) |
5 | sseq2 3846 | . . . . . 6 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐵 ⊆ (𝐴 ∩ 𝐵) ↔ 𝐵 ⊆ ∅)) | |
6 | 4, 5 | syl5bb 275 | . . . . 5 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ ∅)) |
7 | ss0 4200 | . . . . 5 ⊢ (𝐵 ⊆ ∅ → 𝐵 = ∅) | |
8 | 6, 7 | syl6bi 245 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐵 ⊆ 𝐴 → 𝐵 = ∅)) |
9 | 8 | necon3ad 2982 | . . 3 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐵 ≠ ∅ → ¬ 𝐵 ⊆ 𝐴)) |
10 | 9 | imp 397 | . 2 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐵 ≠ ∅) → ¬ 𝐵 ⊆ 𝐴) |
11 | nsspssun 4084 | . . 3 ⊢ (¬ 𝐵 ⊆ 𝐴 ↔ 𝐴 ⊊ (𝐵 ∪ 𝐴)) | |
12 | uncom 3980 | . . . 4 ⊢ (𝐵 ∪ 𝐴) = (𝐴 ∪ 𝐵) | |
13 | 12 | psseq2i 3919 | . . 3 ⊢ (𝐴 ⊊ (𝐵 ∪ 𝐴) ↔ 𝐴 ⊊ (𝐴 ∪ 𝐵)) |
14 | 11, 13 | bitri 267 | . 2 ⊢ (¬ 𝐵 ⊆ 𝐴 ↔ 𝐴 ⊊ (𝐴 ∪ 𝐵)) |
15 | 10, 14 | sylib 210 | 1 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐵 ≠ ∅) → 𝐴 ⊊ (𝐴 ∪ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 386 = wceq 1601 ≠ wne 2969 ∪ cun 3790 ∩ cin 3791 ⊆ wss 3792 ⊊ wpss 3793 ∅c0 4141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-ext 2754 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-v 3400 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 |
This theorem is referenced by: isfin1-3 9543 |
Copyright terms: Public domain | W3C validator |