Theorem ssuni 3766

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 2204	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝐵))
2	1	imbi1d 230	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶) ↔ (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶)))
3		elunii 3749	. . . . . . 7 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝐶) → 𝑦 ∈ ∪ 𝐶)
4	3	expcom 115	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → (𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝐶))
5	2, 4	vtoclga 2755	. . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ∪ 𝐶))
6	5	imim2d 54	. . . 4 ⊢ (𝐵 ∈ 𝐶 → ((𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶)))
7	6	alimdv 1852	. . 3 ⊢ (𝐵 ∈ 𝐶 → (∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶)))
8		dfss2 3091	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵))
9		dfss2 3091	. . 3 ⊢ (𝐴 ⊆ ∪ 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ ∪ 𝐶))
10	7, 8, 9	3imtr4g 204	. 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊆ ∪ 𝐶))
11	10	impcom 124	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶)

Syntax hints:   → wi 4   ∧ wa 103  ∀wal 1330   = wceq 1332   ∈ wcel 1481   ⊆ wss 3076  ∪ cuni 3744

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-in 3082  df-ss 3089  df-uni 3745

This theorem is referenced by:  elssuni  3772  uniss2  3775  ssorduni  4411