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

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ⊆ wss 3905  ∪ cuni 4872

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-ss 3922  df-uni 4873

This theorem is referenced by:  elpwuni  5071  mretopd  23249  toponmre  23250  neiptopuni  23287  filunibas  24038  unidmvol  25700  unicls  34293  carsguni  34698  onintunirab  43974