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

Theorem onsssupeqcond 43959
Description: If for every element of a set of ordinals there is an element of a subset which is at least as large, then the union of the set and the subset is the same. Lemma 2.12 of [Schloeder] p. 5. (Contributed by RP, 27-Jan-2025.)
Assertion
Ref Expression
onsssupeqcond ((𝐴 ⊆ On ∧ 𝐴𝑉) → ((𝐵𝐴 ∧ ∀𝑎𝐴𝑏𝐵 𝑎𝑏) → 𝐴 = 𝐵))
Distinct variable groups:   𝐴,𝑎   𝐵,𝑎,𝑏
Allowed substitution hints:   𝐴(𝑏)   𝑉(𝑎,𝑏)

Proof of Theorem onsssupeqcond
StepHypRef Expression
1 uniss2 4912 . . . 4 (∀𝑎𝐴𝑏𝐵 𝑎𝑏 𝐴 𝐵)
21adantl 486 . . 3 ((𝐵𝐴 ∧ ∀𝑎𝐴𝑏𝐵 𝑎𝑏) → 𝐴 𝐵)
3 uniss 4885 . . . 4 (𝐵𝐴 𝐵 𝐴)
43adantr 485 . . 3 ((𝐵𝐴 ∧ ∀𝑎𝐴𝑏𝐵 𝑎𝑏) → 𝐵 𝐴)
52, 4eqssd 3962 . 2 ((𝐵𝐴 ∧ ∀𝑎𝐴𝑏𝐵 𝑎𝑏) → 𝐴 = 𝐵)
65a1i 11 1 ((𝐴 ⊆ On ∧ 𝐴𝑉) → ((𝐵𝐴 ∧ ∀𝑎𝐴𝑏𝐵 𝑎𝑏) → 𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1568  wcel 2150  wral 3086  wrex 3096  wss 3913   cuni 4877  Oncon0 6364
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-ext 2742
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-ral 3087  df-rex 3097  df-v 3464  df-ss 3930  df-uni 4878
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator