Theorem onzsl 7790

Description: An ordinal number is zero, a successor ordinal, or a limit ordinal number. (Contributed by NM, 1-Oct-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
onzsl	⊢ (𝐴 ∈ On ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))

Distinct variable group:   𝑥,𝐴

Proof of Theorem onzsl

Step	Hyp	Ref	Expression
1		elex 3462	. . 3 ⊢ (𝐴 ∈ On → 𝐴 ∈ V)
2		eloni 6328	. . 3 ⊢ (𝐴 ∈ On → Ord 𝐴)
3		ordzsl 7789	. . . 4 ⊢ (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
4		3mix1 1332	. . . . . 6 ⊢ (𝐴 = ∅ → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
5	4	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐴 = ∅) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
6		3mix2 1333	. . . . . 6 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
7	6	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ V ∧ ∃𝑥 ∈ On 𝐴 = suc 𝑥) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
8		3mix3 1334	. . . . 5 ⊢ ((𝐴 ∈ V ∧ Lim 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
9	5, 7, 8	3jaodan 1434	. . . 4 ⊢ ((𝐴 ∈ V ∧ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
10	3, 9	sylan2b 595	. . 3 ⊢ ((𝐴 ∈ V ∧ Ord 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
11	1, 2, 10	syl2anc 585	. 2 ⊢ (𝐴 ∈ On → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
12		0elon 6373	. . . 4 ⊢ ∅ ∈ On
13		eleq1 2825	. . . 4 ⊢ (𝐴 = ∅ → (𝐴 ∈ On ↔ ∅ ∈ On))
14	12, 13	mpbiri 258	. . 3 ⊢ (𝐴 = ∅ → 𝐴 ∈ On)
15		onsuc 7757	. . . . 5 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
16		eleq1 2825	. . . . 5 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
17	15, 16	syl5ibrcom 247	. . . 4 ⊢ (𝑥 ∈ On → (𝐴 = suc 𝑥 → 𝐴 ∈ On))
18	17	rexlimiv 3131	. . 3 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → 𝐴 ∈ On)
19		limelon 6383	. . 3 ⊢ ((𝐴 ∈ V ∧ Lim 𝐴) → 𝐴 ∈ On)
20	14, 18, 19	3jaoi 1431	. 2 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)) → 𝐴 ∈ On)
21	11, 20	impbii 209	1 ⊢ (𝐴 ∈ On ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∨ w3o 1086   = wceq 1542   ∈ wcel 2114  ∃wrex 3061  Vcvv 3441  ∅c0 4286  Ord word 6317  Oncon0 6318  Lim wlim 6319  suc csuc 6320

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324

This theorem is referenced by:  oawordeulem  8483  r1pwss  9700  r1val1  9702  pwcfsdom  10498  winalim2  10611  rankcf  10692  dfrdg4  36147  naddwordnexlem4  43710