![]() |
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 3970 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) | |
2 | 1 | ralimi 3077 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) |
3 | rmoim 3731 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶) → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
4 | 2, 3 | syl 17 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
5 | 4 | alimdv 1911 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
6 | df-disj 5107 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
7 | df-disj 5107 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
8 | 5, 6, 7 | 3imtr4g 296 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1531 ∈ wcel 2098 ∀wral 3055 ∃*wrmo 3369 ⊆ wss 3943 Disj wdisj 5106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1536 df-ex 1774 df-sb 2060 df-mo 2528 df-clab 2704 df-cleq 2718 df-clel 2804 df-ral 3056 df-rmo 3370 df-v 3470 df-in 3950 df-ss 3960 df-disj 5107 |
This theorem is referenced by: disjeq2 5110 0disj 5133 uniioombllem2 25462 uniioombllem4 25465 disjxwwlksn 29662 disjxwwlkn 29671 fusgreghash2wspv 30092 fsumiunss 44845 |
Copyright terms: Public domain | W3C validator |