Metamath Proof Explorer


Theorem onsupsucismax

Description: If the union of a set of ordinals is a successor ordinal, then that union is the maximum element of the set. This is not a bijection because sets where the maximum element is zero or a limit ordinal exist. Lemma 2.11 of Schloeder p. 5. (Contributed by RP, 27-Jan-2025)

Ref Expression
Assertion onsupsucismax ⊢ A ⊆ On ∧ A ∈ V → ∃ b ∈ On ⋃ A = suc ⁡ b → ⋃ A ∈ A

Proof

Step Hyp Ref Expression
1 onsupnmax ⊢ A ⊆ On → ¬ ⋃ A ∈ A → ⋃ A = ⋃ ⋃ A
2 ssorduni ⊢ A ⊆ On → Ord ⁡ ⋃ A
3 orduninsuc ⊢ Ord ⁡ ⋃ A → ⋃ A = ⋃ ⋃ A ↔ ¬ ∃ b ∈ On ⋃ A = suc ⁡ b
4 2 3 syl ⊢ A ⊆ On → ⋃ A = ⋃ ⋃ A ↔ ¬ ∃ b ∈ On ⋃ A = suc ⁡ b
5 1 4 sylibd ⊢ A ⊆ On → ¬ ⋃ A ∈ A → ¬ ∃ b ∈ On ⋃ A = suc ⁡ b
6 5 con4d ⊢ A ⊆ On → ∃ b ∈ On ⋃ A = suc ⁡ b → ⋃ A ∈ A
7 6 adantr ⊢ A ⊆ On ∧ A ∈ V → ∃ b ∈ On ⋃ A = suc ⁡ b → ⋃ A ∈ A