Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nnuni Structured version   Visualization version   GIF version

Theorem nnuni 36219
Description: The union of a finite ordinal is a finite ordinal. (Contributed by Scott Fenton, 17-Oct-2024.)
Assertion
Ref Expression
nnuni (𝐴 ∈ ω → 𝐴 ∈ ω)

Proof of Theorem nnuni
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 nn0suc 7887 . 2 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
2 unieq 4883 . . . . 5 (𝐴 = ∅ → 𝐴 = ∅)
3 uni0 4901 . . . . 5 ∅ = ∅
42, 3eqtrdi 2814 . . . 4 (𝐴 = ∅ → 𝐴 = ∅)
5 peano1 7881 . . . 4 ∅ ∈ ω
64, 5eqeltrdi 2871 . . 3 (𝐴 = ∅ → 𝐴 ∈ ω)
7 nnord 7866 . . . . . . 7 (𝑥 ∈ ω → Ord 𝑥)
8 ordunisuc 7824 . . . . . . 7 (Ord 𝑥 suc 𝑥 = 𝑥)
97, 8syl 18 . . . . . 6 (𝑥 ∈ ω → suc 𝑥 = 𝑥)
10 id 23 . . . . . 6 (𝑥 ∈ ω → 𝑥 ∈ ω)
119, 10eqeltrd 2863 . . . . 5 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
12 unieq 4883 . . . . . 6 (𝐴 = suc 𝑥 𝐴 = suc 𝑥)
1312eleq1d 2848 . . . . 5 (𝐴 = suc 𝑥 → ( 𝐴 ∈ ω ↔ suc 𝑥 ∈ ω))
1411, 13syl5ibrcom 250 . . . 4 (𝑥 ∈ ω → (𝐴 = suc 𝑥 𝐴 ∈ ω))
1514rexlimiv 3159 . . 3 (∃𝑥 ∈ ω 𝐴 = suc 𝑥 𝐴 ∈ ω)
166, 15jaoi 870 . 2 ((𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
171, 16syl 18 1 (𝐴 ∈ ω → 𝐴 ∈ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 860   = wceq 1570  wcel 2143  wrex 3089  c0 4286   cuni 4872  Ord word 6359  suc csuc 6362  ωcom 7858
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-tr 5219  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-om 7859
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator