Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onsupintrab2 Structured version   Visualization version   GIF version

Theorem onsupintrab2 43221
Description: The supremum of a set of ordinals is the intersection of every ordinal greater-than-or-equal to every member of the set. (Contributed by RP, 23-Jan-2025.)
Assertion
Ref Expression
onsupintrab2 (𝐴 ∈ 𝒫 On → sup(𝐴, On, E ) = {𝑥 ∈ On ∣ ∀𝑦𝐴 𝑦𝑥})
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem onsupintrab2
StepHypRef Expression
1 elpwb 4613 . 2 (𝐴 ∈ 𝒫 On ↔ (𝐴 ∈ V ∧ 𝐴 ⊆ On))
2 onsupintrab 43220 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ∈ V) → sup(𝐴, On, E ) = {𝑥 ∈ On ∣ ∀𝑦𝐴 𝑦𝑥})
32ancoms 458 . 2 ((𝐴 ∈ V ∧ 𝐴 ⊆ On) → sup(𝐴, On, E ) = {𝑥 ∈ On ∣ ∀𝑦𝐴 𝑦𝑥})
41, 3sylbi 217 1 (𝐴 ∈ 𝒫 On → sup(𝐴, On, E ) = {𝑥 ∈ On ∣ ∀𝑦𝐴 𝑦𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wral 3059  {crab 3433  Vcvv 3478  wss 3963  𝒫 cpw 4605   cint 4951   E cep 5588  Oncon0 6386  supcsup 9478
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-ord 6389  df-on 6390  df-iota 6516  df-riota 7388  df-sup 9480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator