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

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

Proof of Theorem onsucunitp
StepHypRef Expression
1 onun2 6478 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝐵) ∈ On)
2 onsucunipr 44140 . . . 4 (((𝐴𝐵) ∈ On ∧ 𝐶 ∈ On) → suc {(𝐴𝐵), 𝐶} = {suc (𝐴𝐵), suc 𝐶})
31, 2sylan 592 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc {(𝐴𝐵), 𝐶} = {suc (𝐴𝐵), suc 𝐶})
4 uniprg 4893 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → {𝐴, 𝐵} = (𝐴𝐵))
54adantr 486 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {𝐴, 𝐵} = (𝐴𝐵))
6 unisng 4895 . . . . . . 7 (𝐶 ∈ On → {𝐶} = 𝐶)
76adantl 487 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {𝐶} = 𝐶)
85, 7uneq12d 4126 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ( {𝐴, 𝐵} ∪ {𝐶}) = ((𝐴𝐵) ∪ 𝐶))
9 df-tp 4599 . . . . . . . 8 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
109unieqi 4889 . . . . . . 7 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
11 uniun 4900 . . . . . . 7 ({𝐴, 𝐵} ∪ {𝐶}) = ( {𝐴, 𝐵} ∪ {𝐶})
1210, 11eqtri 2789 . . . . . 6 {𝐴, 𝐵, 𝐶} = ( {𝐴, 𝐵} ∪ {𝐶})
1312a1i 11 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {𝐴, 𝐵, 𝐶} = ( {𝐴, 𝐵} ∪ {𝐶}))
14 uniprg 4893 . . . . . 6 (((𝐴𝐵) ∈ On ∧ 𝐶 ∈ On) → {(𝐴𝐵), 𝐶} = ((𝐴𝐵) ∪ 𝐶))
151, 14sylan 592 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {(𝐴𝐵), 𝐶} = ((𝐴𝐵) ∪ 𝐶))
168, 13, 153eqtr4d 2811 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {𝐴, 𝐵, 𝐶} = {(𝐴𝐵), 𝐶})
17 suceq 6436 . . . 4 ( {𝐴, 𝐵, 𝐶} = {(𝐴𝐵), 𝐶} → suc {𝐴, 𝐵, 𝐶} = suc {(𝐴𝐵), 𝐶})
1816, 17syl 18 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc {𝐴, 𝐵, 𝐶} = suc {(𝐴𝐵), 𝐶})
19 df-tp 4599 . . . . . 6 {suc 𝐴, suc 𝐵, suc 𝐶} = ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
2019unieqi 4889 . . . . 5 {suc 𝐴, suc 𝐵, suc 𝐶} = ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
21 uniun 4900 . . . . 5 ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶}) = ( {suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
2220, 21eqtri 2789 . . . 4 {suc 𝐴, suc 𝐵, suc 𝐶} = ( {suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
23 onsuc 7818 . . . . . . 7 ((𝐴𝐵) ∈ On → suc (𝐴𝐵) ∈ On)
241, 23syl 18 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴𝐵) ∈ On)
25 onsuc 7818 . . . . . 6 (𝐶 ∈ On → suc 𝐶 ∈ On)
26 uniprg 4893 . . . . . 6 ((suc (𝐴𝐵) ∈ On ∧ suc 𝐶 ∈ On) → {suc (𝐴𝐵), suc 𝐶} = (suc (𝐴𝐵) ∪ suc 𝐶))
2724, 25, 26syl2an 608 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {suc (𝐴𝐵), suc 𝐶} = (suc (𝐴𝐵) ∪ suc 𝐶))
28 suceq 6436 . . . . . . . . 9 ( {𝐴, 𝐵} = (𝐴𝐵) → suc {𝐴, 𝐵} = suc (𝐴𝐵))
294, 28syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc {𝐴, 𝐵} = suc (𝐴𝐵))
30 onsucunipr 44140 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc {𝐴, 𝐵} = {suc 𝐴, suc 𝐵})
3129, 30eqtr3d 2803 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴𝐵) = {suc 𝐴, suc 𝐵})
3231adantr 486 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc (𝐴𝐵) = {suc 𝐴, suc 𝐵})
33 unisng 4895 . . . . . . . . 9 (suc 𝐶 ∈ On → {suc 𝐶} = suc 𝐶)
3425, 33syl 18 . . . . . . . 8 (𝐶 ∈ On → {suc 𝐶} = suc 𝐶)
3534eqcomd 2772 . . . . . . 7 (𝐶 ∈ On → suc 𝐶 = {suc 𝐶})
3635adantl 487 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc 𝐶 = {suc 𝐶})
3732, 36uneq12d 4126 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → (suc (𝐴𝐵) ∪ suc 𝐶) = ( {suc 𝐴, suc 𝐵} ∪ {suc 𝐶}))
3827, 37eqtrd 2801 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {suc (𝐴𝐵), suc 𝐶} = ( {suc 𝐴, suc 𝐵} ∪ {suc 𝐶}))
3922, 38eqtr4id 2820 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → {suc 𝐴, suc 𝐵, suc 𝐶} = {suc (𝐴𝐵), suc 𝐶})
403, 18, 393eqtr4d 2811 . 2 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc {𝐴, 𝐵, 𝐶} = {suc 𝐴, suc 𝐵, suc 𝐶})
41403impa 1127 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → suc {𝐴, 𝐵, 𝐶} = {suc 𝐴, suc 𝐵, suc 𝐶})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  cun 3906  {csn 4594  {cpr 4596  {ctp 4598   cuni 4877  Oncon0 6367  suc csuc 6369
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-tr 5224  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-ord 6370  df-on 6371  df-suc 6373
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator