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

Theorem onsucunipr 43361
Description: The successor to the union of any pair of ordinals is the union of the successors of the elements. (Contributed by RP, 12-Feb-2025.)
Assertion
Ref Expression
onsucunipr ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc {𝐴, 𝐵} = {suc 𝐴, suc 𝐵})

Proof of Theorem onsucunipr
StepHypRef Expression
1 ssequn1 4195 . . . . . 6 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐵)
2 suceq 6451 . . . . . 6 ((𝐴𝐵) = 𝐵 → suc (𝐴𝐵) = suc 𝐵)
31, 2sylbi 217 . . . . 5 (𝐴𝐵 → suc (𝐴𝐵) = suc 𝐵)
43adantl 481 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → suc (𝐴𝐵) = suc 𝐵)
5 onsucwordi 43277 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))
65imp 406 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → suc 𝐴 ⊆ suc 𝐵)
7 ssequn1 4195 . . . . 5 (suc 𝐴 ⊆ suc 𝐵 ↔ (suc 𝐴 ∪ suc 𝐵) = suc 𝐵)
86, 7sylib 218 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → (suc 𝐴 ∪ suc 𝐵) = suc 𝐵)
94, 8eqtr4d 2777 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴𝐵) → suc (𝐴𝐵) = (suc 𝐴 ∪ suc 𝐵))
10 ssequn2 4198 . . . . . 6 (𝐵𝐴 ↔ (𝐴𝐵) = 𝐴)
11 suceq 6451 . . . . . 6 ((𝐴𝐵) = 𝐴 → suc (𝐴𝐵) = suc 𝐴)
1210, 11sylbi 217 . . . . 5 (𝐵𝐴 → suc (𝐴𝐵) = suc 𝐴)
1312adantl 481 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵𝐴) → suc (𝐴𝐵) = suc 𝐴)
14 onsucwordi 43277 . . . . . . 7 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵𝐴 → suc 𝐵 ⊆ suc 𝐴))
1514ancoms 458 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵𝐴 → suc 𝐵 ⊆ suc 𝐴))
1615imp 406 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵𝐴) → suc 𝐵 ⊆ suc 𝐴)
17 ssequn2 4198 . . . . 5 (suc 𝐵 ⊆ suc 𝐴 ↔ (suc 𝐴 ∪ suc 𝐵) = suc 𝐴)
1816, 17sylib 218 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵𝐴) → (suc 𝐴 ∪ suc 𝐵) = suc 𝐴)
1913, 18eqtr4d 2777 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐵𝐴) → suc (𝐴𝐵) = (suc 𝐴 ∪ suc 𝐵))
20 eloni 6395 . . . 4 (𝐴 ∈ On → Ord 𝐴)
21 eloni 6395 . . . 4 (𝐵 ∈ On → Ord 𝐵)
22 ordtri2or2 6484 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴𝐵𝐵𝐴))
2320, 21, 22syl2an 596 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝐵𝐵𝐴))
249, 19, 23mpjaodan 960 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴𝐵) = (suc 𝐴 ∪ suc 𝐵))
25 uniprg 4927 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → {𝐴, 𝐵} = (𝐴𝐵))
26 suceq 6451 . . 3 ( {𝐴, 𝐵} = (𝐴𝐵) → suc {𝐴, 𝐵} = suc (𝐴𝐵))
2725, 26syl 17 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc {𝐴, 𝐵} = suc (𝐴𝐵))
28 onsuc 7830 . . 3 (𝐴 ∈ On → suc 𝐴 ∈ On)
29 onsuc 7830 . . 3 (𝐵 ∈ On → suc 𝐵 ∈ On)
30 uniprg 4927 . . 3 ((suc 𝐴 ∈ On ∧ suc 𝐵 ∈ On) → {suc 𝐴, suc 𝐵} = (suc 𝐴 ∪ suc 𝐵))
3128, 29, 30syl2an 596 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → {suc 𝐴, suc 𝐵} = (suc 𝐴 ∪ suc 𝐵))
3224, 27, 313eqtr4d 2784 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc {𝐴, 𝐵} = {suc 𝐴, suc 𝐵})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847   = wceq 1536  wcel 2105  cun 3960  wss 3962  {cpr 4632   cuni 4911  Ord word 6384  Oncon0 6385  suc csuc 6387
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437  ax-un 7753
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-tr 5265  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-we 5642  df-ord 6388  df-on 6389  df-suc 6391
This theorem is referenced by:  onsucunitp  43362
  Copyright terms: Public domain W3C validator