Theorem unilbss 49440

Description: Superclass of the greatest lower bound. A dual statement of ssintub 4925. (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 4900	. 2 ⊢ (∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ⊆ 𝐴 ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴)
2		sseq1 3962	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴))
3	2	elrab 3651	. . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ⊆ 𝐴))
4	3	simprbi 501	. 2 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} → 𝑦 ⊆ 𝐴)
5	1, 4	mprgbir 3084	1 ⊢ ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ⊆ 𝐴

Syntax hints:   ∈ wcel 2143  {crab 3415   ⊆ wss 3905  ∪ cuni 4866

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1564  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3078  df-rab 3416  df-v 3457  df-ss 3922  df-uni 4867

This theorem is referenced by:  unilbeu  49607