Theorem ssunieq 4907

Description: Relationship implying union. (Contributed by NM, 10-Nov-1999.)

Assertion

Ref	Expression
ssunieq	⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → 𝐴 = ∪ 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem ssunieq

Step	Hyp	Ref	Expression
1		elssuni 4902	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ ∪ 𝐵)
2		unissb 4904	. . . 4 ⊢ (∪ 𝐵 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴)
3	2	biimpri 231	. . 3 ⊢ (∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴 → ∪ 𝐵 ⊆ 𝐴)
4	1, 3	anim12i 625	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴))
5		eqss 3949	. 2 ⊢ (𝐴 = ∪ 𝐵 ↔ (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴))
6	4, 5	sylibr 237	1 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → 𝐴 = ∪ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078   ⊆ 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-ral 3079  df-v 3455  df-ss 3919  df-uni 4871

This theorem is used by:  unimax  4908  shsspwh  31713