| 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 3925 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) | |
| 2 | 1 | ralimi 3071 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶)) |
| 3 | rmoim 3696 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐶) → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 5 | 4 | alimdv 1917 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) |
| 6 | df-disj 5064 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 7 | df-disj 5064 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 8 | 5, 6, 7 | 3imtr4g 296 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1539 ∈ wcel 2113 ∀wral 3049 ∃*wrmo 3347 ⊆ wss 3899 Disj wdisj 5063 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-mo 2537 df-clel 2809 df-ral 3050 df-rmo 3348 df-ss 3916 df-disj 5064 |
| This theorem is referenced by: disjeq2 5067 0disj 5089 uniioombllem2 25538 uniioombllem4 25541 disjxwwlksn 29926 disjxwwlkn 29935 fusgreghash2wspv 30359 fsumiunss 45763 |
| Copyright terms: Public domain | W3C validator |