Theorem ssuni 4896

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

Assertion

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

Proof of Theorem ssuni

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elunii 4875	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝑥 ∈ ∪ 𝐶)
2	1	expcom 419	. . . . 5 ⊢ (𝐵 ∈ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ ∪ 𝐶))
3	2	imim2d 58	. . . 4 ⊢ (𝐵 ∈ 𝐶 → ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶)))
4	3	alimdv 1949	. . 3 ⊢ (𝐵 ∈ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶)))
5		df-ss 3919	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
6		df-ss 3919	. . 3 ⊢ (𝐴 ⊆ ∪ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐶))
7	4, 5, 6	3imtr4g 299	. 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊆ ∪ 𝐶))
8	7	impcom 413	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊆ ∪ 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   ∈ wcel 2145   ⊆ wss 3902  ∪ cuni 4870

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-uni 4871

This theorem is used by:  elssuni  4902  uniss2  4905  ssorduni  7782  filssufilg  24143  alexsubALTlem2  24280  utoptop  24466  locfinreflem  34358  bj-sselpwuni  37802  setrec1  50625