Theorem ssuni 3649

Description: Subclass relationship for class union. (Contributed by NM, 24-May-1994.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)

Assertion

Ref	Expression
ssuni	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶)

Proof of Theorem ssuni

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2146	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝐵))
2	1	imbi1d 229	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶) ↔ (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶)))
3		elunii 3632	. . . . . . 7 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐶) → 𝑦 ∈ ∪ 𝐶)
4	3	expcom 114	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → (𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶))
5	2, 4	vtoclga 2675	. . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶))
6	5	imim2d 53	. . . 4 ⊢ (𝐵 ∈ 𝐶 → ((𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶)))
7	6	alimdv 1802	. . 3 ⊢ (𝐵 ∈ 𝐶 → (∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶)))
8		dfss2 2999	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵))
9		dfss2 2999	. . 3 ⊢ (𝐴 ⊆ ∪ 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶))
10	7, 8, 9	3imtr4g 203	. 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊆ ∪ 𝐶))
11	10	impcom 123	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶)

Syntax hints:   → wi 4   ∧ wa 102  ∀wal 1283   = wceq 1285   ∈ wcel 1434   ⊆ wss 2984  ∪ cuni 3627

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065

This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1688  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-v 2614  df-in 2990  df-ss 2997  df-uni 3628

This theorem is referenced by:  elssuni  3655  uniss2  3658  ssorduni  4267