Theorem onsupuni2 41969

Description: The supremum of a set of ordinals is the union of that set. (Contributed by RP, 22-Jan-2025.)

Assertion

Ref	Expression
onsupuni2	⊢ (𝐴 ∈ 𝒫 On → sup(𝐴, On, E ) = ∪ 𝐴)

Proof of Theorem onsupuni2

Step	Hyp	Ref	Expression
1		elpwb 4610	. 2 ⊢ (𝐴 ∈ 𝒫 On ↔ (𝐴 ∈ V ∧ 𝐴 ⊆ On))
2		onsupuni 41968	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ V) → sup(𝐴, On, E ) = ∪ 𝐴)
3	2	ancoms 459	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐴 ⊆ On) → sup(𝐴, On, E ) = ∪ 𝐴)
4	1, 3	sylbi 216	1 ⊢ (𝐴 ∈ 𝒫 On → sup(𝐴, On, E ) = ∪ 𝐴)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3474   ⊆ wss 3948  𝒫 cpw 4602  ∪ cuni 4908   E cep 5579  Oncon0 6364  supcsup 9434

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7724

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367  df-on 6368  df-iota 6495  df-riota 7364  df-sup 9436

This theorem is referenced by: (None)