Theorem ssunieq 4866

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 4861	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ ∪ 𝐵)
2		unissb 4863	. . . 4 ⊢ (∪ 𝐵 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴)
3	2	biimpri 230	. . 3 ⊢ (∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴 → ∪ 𝐵 ⊆ 𝐴)
4	1, 3	anim12i 614	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴))
5		eqss 3982	. 2 ⊢ (𝐴 = ∪ 𝐵 ↔ (𝐴 ⊆ ∪ 𝐵 ∧ ∪ 𝐵 ⊆ 𝐴))
6	4, 5	sylibr 236	1 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 𝑥 ⊆ 𝐴) → 𝐴 = ∪ 𝐵)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138   ⊆ wss 3936  ∪ cuni 4832

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-v 3497  df-in 3943  df-ss 3952  df-uni 4833

This theorem is referenced by:  unimax  4867  shsspwh  29017