| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjss1 | Structured version Visualization version GIF version | ||
| Description: A subset of a disjoint collection is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disjss1 | ⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 3907 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) | |
| 2 | 1 | anim1d 623 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
| 3 | 2 | moimdv 2574 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶))) |
| 4 | 3 | alimdv 1951 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑦∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶))) |
| 5 | dfdisj2 5077 | . 2 ⊢ (Disj 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
| 6 | dfdisj2 5077 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶)) | |
| 7 | 4, 5, 6 | 3imtr4g 299 | 1 ⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1568 ∈ wcel 2147 ∃*wmo 2565 ⊆ wss 3900 Disj wdisj 5075 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-mo 2567 df-clel 2839 df-rmo 3369 df-ss 3901 df-disj 5076 |
| This theorem is used by: disjeq1 5082 disjx0 5103 disjxiun 5105 disjss3 5107 volfiniun 25923 uniioovol 25955 uniioombllem4 25962 disjiunel 33288 tocyccntz 33804 carsggect 35061 carsgclctunlem2 35062 omsmeas 35066 sibfof 35083 disjf1o 46540 fsumiunss 46921 sge0iunmptlemre 47759 meadjiunlem 47809 meaiuninclem 47824 |
| Copyright terms: Public domain | W3C validator |