| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjss2 | Structured version Visualization version GIF version | ||
| Description: If each element of a collection is contained in a disjoint collection, the original collection is also disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disjss2 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 3909 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) | |
| 2 | 1 | ralimi 3076 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) |
| 3 | rmoim 3681 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶) → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 5 | 4 | alimdv 1923 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 6 | df-disj 5040 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 7 | df-disj 5040 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 8 | 5, 6, 7 | 3imtr4g 297 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1545 ∈ wcel 2119 ∀wral 3053 ∃*wrmo 3343 ⊆ wss 3883 Disj wdisj 5039 |
| 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 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-mo 2543 df-clel 2814 df-ral 3054 df-rmo 3344 df-ss 3900 df-disj 5040 |
| This theorem is referenced by: disjeq2 5043 0disj 5065 uniioombllem2 25568 uniioombllem4 25571 disjxwwlksn 29990 disjxwwlkn 29999 fusgreghash2wspv 30423 fsumiunss 46020 |
| Copyright terms: Public domain | W3C validator |