| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssuni | GIF version | ||
| Description: Subclass relationship for class union. (Contributed by NM, 24-May-1994.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) |
| Ref | Expression |
|---|---|
| ssuni | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2296 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝐵)) | |
| 2 | 1 | imbi1d 231 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶) ↔ (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶))) |
| 3 | elunii 3918 | . . . . . . 7 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐶) → 𝑦 ∈ ∪ 𝐶) | |
| 4 | 3 | expcom 116 | . . . . . 6 ⊢ (𝑥 ∈ 𝐶 → (𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶)) |
| 5 | 2, 4 | vtoclga 2880 | . . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶)) |
| 6 | 5 | imim2d 54 | . . . 4 ⊢ (𝐵 ∈ 𝐶 → ((𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶))) |
| 7 | 6 | alimdv 1928 | . . 3 ⊢ (𝐵 ∈ 𝐶 → (∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶))) |
| 8 | ssalel 3225 | . . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵)) | |
| 9 | ssalel 3225 | . . 3 ⊢ (𝐴 ⊆ ∪ 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶)) | |
| 10 | 7, 8, 9 | 3imtr4g 205 | . 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊆ ∪ 𝐶)) |
| 11 | 10 | impcom 125 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1396 = wceq 1398 ∈ wcel 2203 ⊆ wss 3210 ∪ cuni 3913 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2814 df-in 3216 df-ss 3223 df-uni 3914 |
| This theorem is referenced by: elssuni 3941 uniss2 3944 ssorduni 4608 |
| Copyright terms: Public domain | W3C validator |