Theorem onsuplub 44193

Description: The supremum of a set of ordinals is the least upper bound. (Contributed by RP, 27-Jan-2025.)

Assertion

Ref	Expression
onsuplub	⊢ (((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∈ On) → (𝐵 ∈ ∪ 𝐴 ↔ ∃𝑧 ∈ 𝐴 𝐵 ∈ 𝑧))

Distinct variable groups:   𝑧,𝐴   𝑧,𝐵

Allowed substitution hint:   𝑉(𝑧)

Proof of Theorem onsuplub

Step	Hyp	Ref	Expression
1		eluni2 4870	. 2 ⊢ (𝐵 ∈ ∪ 𝐴 ↔ ∃𝑧 ∈ 𝐴 𝐵 ∈ 𝑧)
2	1	a1i 11	1 ⊢ (((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∈ On) → (𝐵 ∈ ∪ 𝐴 ↔ ∃𝑧 ∈ 𝐴 𝐵 ∈ 𝑧))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∃wrex 3086   ⊆ wss 3898  ∪ cuni 4866  Oncon0 6351

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 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-v 3452  df-uni 4867

This theorem is used by: (None)