Theorem unissel 4951

Description: Condition turning a subclass relationship for union into an equality. (Contributed by NM, 18-Jul-2006.)

Assertion

Ref	Expression
unissel	⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵)

Proof of Theorem unissel

Step	Hyp	Ref	Expression
1		simpl 481	. 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 ⊆ 𝐵)
2		elssuni 4950	. . 3 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝐴)
3	2	adantl 480	. 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝐴)
4	1, 3	eqssd 4009	1 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵)

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1534   ∈ wcel 2100   ⊆ wss 3959  ∪ cuni 4918

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2102  ax-9 2110  ax-ext 2700

This theorem depends on definitions:  df-bi 206  df-an 395  df-tru 1537  df-ex 1775  df-sb 2062  df-clab 2707  df-cleq 2721  df-clel 2806  df-v 3474  df-ss 3976  df-uni 4919

This theorem is referenced by:  elpwuni  5118  mretopd  23110  toponmre  23111  neiptopuni  23148  filunibas  23899  unidmvol  25584  unicls  33756  carsguni  34180  onintunirab  42954