Theorem unissel 4905

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 488	. 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 ⊆ 𝐵)
2		elssuni 4904	. . 3 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝐴)
3	2	adantl 487	. 2 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝐴)
4	1, 3	eqssd 3930	1 ⊢ ((∪ 𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐴) → ∪ 𝐴 = 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∪ cuni 4872

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-uni 4873

This theorem is used by:  elpwuni  5070  mretopd  23465  toponmre  23466  neiptopuni  23503  filunibas  24255  unidmvol  25917  unicls  34646  carsguni  35051  onintunirab  44490