Theorem onsucb 4607

Description: A class is an ordinal number if and only if its successor is an ordinal number. Biconditional form of onsuc 4605. (Contributed by NM, 9-Sep-2003.)

Assertion

Ref	Expression
onsucb	⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On)

Proof of Theorem onsucb

Step	Hyp	Ref	Expression
1		onsuc 4605	. 2 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
2		eloni 4478	. . 3 ⊢ (suc 𝐴 ∈ On → Ord suc 𝐴)
3		elex 2815	. . . . 5 ⊢ (suc 𝐴 ∈ On → suc 𝐴 ∈ V)
4		sucexb 4601	. . . . 5 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
5	3, 4	sylibr 134	. . . 4 ⊢ (suc 𝐴 ∈ On → 𝐴 ∈ V)
6		elong 4476	. . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
7		ordsucg 4606	. . . . 5 ⊢ (𝐴 ∈ V → (Ord 𝐴 ↔ Ord suc 𝐴))
8	6, 7	bitrd 188	. . . 4 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord suc 𝐴))
9	5, 8	syl 14	. . 3 ⊢ (suc 𝐴 ∈ On → (𝐴 ∈ On ↔ Ord suc 𝐴))
10	2, 9	mpbird 167	. 2 ⊢ (suc 𝐴 ∈ On → 𝐴 ∈ On)
11	1, 10	impbii 126	1 ⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On)

Syntax hints:   ↔ wb 105   ∈ wcel 2202  Vcvv 2803  Ord word 4465  Oncon0 4466  suc csuc 4468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-tr 4193  df-iord 4469  df-on 4471  df-suc 4474

This theorem is referenced by:  onsucmin  4611  onsucuni2  4668