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 44578
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 6494 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∪ 𝐵) ∈ On)
2 onsucunipr 44577 . . . 4 (((𝐴 ∪ 𝐵) ∈ On ∧ 𝐶 ∈ On) → suc ∪ {(𝐴 ∪ 𝐵), 𝐶} = ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶})
31, 2sylan 592 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc ∪ {(𝐴 ∪ 𝐵), 𝐶} = ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶})
4 uniprg 4886 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
54adantr 486 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
6 unisng 4888 . . . . . . 7 (𝐶 ∈ On → ∪ {𝐶} = 𝐶)
76adantl 487 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {𝐶} = 𝐶)
85, 7uneq12d 4171 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → (∪ {𝐴, 𝐵} ∪ ∪ {𝐶}) = ((𝐴 ∪ 𝐵) ∪ 𝐶))
9 df-tp 4593 . . . . . . . 8 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
109unieqi 4882 . . . . . . 7 ∪ {𝐴, 𝐵, 𝐶} = ∪ ({𝐴, 𝐵} ∪ {𝐶})
11 uniun 4893 . . . . . . 7 ∪ ({𝐴, 𝐵} ∪ {𝐶}) = (∪ {𝐴, 𝐵} ∪ ∪ {𝐶})
1210, 11eqtri 2786 . . . . . 6 ∪ {𝐴, 𝐵, 𝐶} = (∪ {𝐴, 𝐵} ∪ ∪ {𝐶})
1312a1i 11 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {𝐴, 𝐵, 𝐶} = (∪ {𝐴, 𝐵} ∪ ∪ {𝐶}))
14 uniprg 4886 . . . . . 6 (((𝐴 ∪ 𝐵) ∈ On ∧ 𝐶 ∈ On) → ∪ {(𝐴 ∪ 𝐵), 𝐶} = ((𝐴 ∪ 𝐵) ∪ 𝐶))
151, 14sylan 592 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {(𝐴 ∪ 𝐵), 𝐶} = ((𝐴 ∪ 𝐵) ∪ 𝐶))
168, 13, 153eqtr4d 2808 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {𝐴, 𝐵, 𝐶} = ∪ {(𝐴 ∪ 𝐵), 𝐶})
17 suceq 6452 . . . 4 (∪ {𝐴, 𝐵, 𝐶} = ∪ {(𝐴 ∪ 𝐵), 𝐶} → suc ∪ {𝐴, 𝐵, 𝐶} = suc ∪ {(𝐴 ∪ 𝐵), 𝐶})
1816, 17syl 18 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc ∪ {𝐴, 𝐵, 𝐶} = suc ∪ {(𝐴 ∪ 𝐵), 𝐶})
19 df-tp 4593 . . . . . 6 {suc 𝐴, suc 𝐵, suc 𝐶} = ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
2019unieqi 4882 . . . . 5 ∪ {suc 𝐴, suc 𝐵, suc 𝐶} = ∪ ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶})
21 uniun 4893 . . . . 5 ∪ ({suc 𝐴, suc 𝐵} ∪ {suc 𝐶}) = (∪ {suc 𝐴, suc 𝐵} ∪ ∪ {suc 𝐶})
2220, 21eqtri 2786 . . . 4 ∪ {suc 𝐴, suc 𝐵, suc 𝐶} = (∪ {suc 𝐴, suc 𝐵} ∪ ∪ {suc 𝐶})
23 onsuc 7851 . . . . . . 7 ((𝐴 ∪ 𝐵) ∈ On → suc (𝐴 ∪ 𝐵) ∈ On)
241, 23syl 18 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴 ∪ 𝐵) ∈ On)
25 onsuc 7851 . . . . . 6 (𝐶 ∈ On → suc 𝐶 ∈ On)
26 uniprg 4886 . . . . . 6 ((suc (𝐴 ∪ 𝐵) ∈ On ∧ suc 𝐶 ∈ On) → ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶} = (suc (𝐴 ∪ 𝐵) ∪ suc 𝐶))
2724, 25, 26syl2an 608 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶} = (suc (𝐴 ∪ 𝐵) ∪ suc 𝐶))
28 suceq 6452 . . . . . . . . 9 (∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵) → suc ∪ {𝐴, 𝐵} = suc (𝐴 ∪ 𝐵))
294, 28syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc ∪ {𝐴, 𝐵} = suc (𝐴 ∪ 𝐵))
30 onsucunipr 44577 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc ∪ {𝐴, 𝐵} = ∪ {suc 𝐴, suc 𝐵})
3129, 30eqtr3d 2800 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → suc (𝐴 ∪ 𝐵) = ∪ {suc 𝐴, suc 𝐵})
3231adantr 486 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc (𝐴 ∪ 𝐵) = ∪ {suc 𝐴, suc 𝐵})
33 unisng 4888 . . . . . . . . 9 (suc 𝐶 ∈ On → ∪ {suc 𝐶} = suc 𝐶)
3425, 33syl 18 . . . . . . . 8 (𝐶 ∈ On → ∪ {suc 𝐶} = suc 𝐶)
3534eqcomd 2769 . . . . . . 7 (𝐶 ∈ On → suc 𝐶 = ∪ {suc 𝐶})
3635adantl 487 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → suc 𝐶 = ∪ {suc 𝐶})
3732, 36uneq12d 4171 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → (suc (𝐴 ∪ 𝐵) ∪ suc 𝐶) = (∪ {suc 𝐴, suc 𝐵} ∪ ∪ {suc 𝐶}))
3827, 37eqtrd 2798 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶} = (∪ {suc 𝐴, suc 𝐵} ∪ ∪ {suc 𝐶}))
3922, 38eqtr4id 2817 . . 3 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ∪ {suc 𝐴, suc 𝐵, suc 𝐶} = ∪ {suc (𝐴 ∪ 𝐵), suc 𝐶})
403, 18, 393eqtr4d 2808 . 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 2147   ∪ cun 4152  {csn 4588  {cpr 4590  {ctp 4592  ∪ cuni 4870  Oncon0 6383  suc csuc 6385
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396  ax-un 7778
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-tr 5217  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-ord 6386  df-on 6387  df-suc 6389
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator