Theorem unilbss 49005

Description: Superclass of the greatest lower bound. A dual statement of ssintub 4919. (Contributed by Zhi Wang, 29-Sep-2024.)

Assertion

Ref	Expression
unilbss	⊢ ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ⊆ 𝐴

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem unilbss

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unissb 4894	. 2 ⊢ (∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ⊆ 𝐴 ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴)
2		sseq1 3957	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴))
3	2	elrab 3644	. . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ⊆ 𝐴))
4	3	simprbi 496	. 2 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} → 𝑦 ⊆ 𝐴)
5	1, 4	mprgbir 3056	1 ⊢ ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ⊆ 𝐴

Syntax hints:   ∈ wcel 2113  {crab 3397   ⊆ wss 3899  ∪ cuni 4861

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rab 3398  df-v 3440  df-ss 3916  df-uni 4862

This theorem is referenced by:  unilbeu  49172