Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iunlub Structured version   Visualization version   GIF version

Theorem iunlub 50324
Description: The indexed union is the the lowest upper bound if it exists. (Contributed by Zhi Wang, 1-Nov-2025.)
Hypotheses
Ref Expression
iunlub.1 (𝜑 → 𝑋 ∈ 𝐴)
iunlub.2 ((𝜑 ∧ 𝑥 = 𝑋) → 𝐵 = 𝐶)
iunlub.3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
Assertion
Ref Expression
iunlub (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝑋   𝜑,𝑥
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunlub
StepHypRef Expression
1 iunlub.3 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
21iunssd 5014 . 2 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
3 iunlub.1 . . . 4 (𝜑 → 𝑋 ∈ 𝐴)
4 iunlub.2 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → 𝐵 = 𝐶)
54sseq2d 3945 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → (𝐶 ⊆ 𝐵 ↔ 𝐶 ⊆ 𝐶))
6 ssidd 3936 . . . 4 (𝜑 → 𝐶 ⊆ 𝐶)
73, 5, 6rspcedvd 3582 . . 3 (𝜑 → ∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)
8 ssiun 5010 . . 3 (∃𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
97, 8syl 18 . 2 (𝜑 → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
102, 9eqssd 3930 1 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  ∪ ciun 4956
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-iun 4958
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator