Theorem ordsucOLD 7753

Description: Obsolete version of ordsuc 7752 as of 6-Jan-2025. (Contributed by NM, 3-Apr-1995.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
ordsucOLD	⊢ (Ord 𝐴 ↔ Ord suc 𝐴)

Proof of Theorem ordsucOLD

Step	Hyp	Ref	Expression
1		elong 6319	. . . 4 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
2		onsuc 7751	. . . . 5 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
3		eloni 6321	. . . . 5 ⊢ (suc 𝐴 ∈ On → Ord suc 𝐴)
4	2, 3	syl 17	. . . 4 ⊢ (𝐴 ∈ On → Ord suc 𝐴)
5	1, 4	biimtrrdi 254	. . 3 ⊢ (𝐴 ∈ V → (Ord 𝐴 → Ord suc 𝐴))
6		sucidg 6394	. . . 4 ⊢ (𝐴 ∈ V → 𝐴 ∈ suc 𝐴)
7		ordelord 6333	. . . . 5 ⊢ ((Ord suc 𝐴 ∧ 𝐴 ∈ suc 𝐴) → Ord 𝐴)
8	7	ex 412	. . . 4 ⊢ (Ord suc 𝐴 → (𝐴 ∈ suc 𝐴 → Ord 𝐴))
9	6, 8	syl5com 31	. . 3 ⊢ (𝐴 ∈ V → (Ord suc 𝐴 → Ord 𝐴))
10	5, 9	impbid 212	. 2 ⊢ (𝐴 ∈ V → (Ord 𝐴 ↔ Ord suc 𝐴))
11		sucprc 6389	. . . 4 ⊢ (¬ 𝐴 ∈ V → suc 𝐴 = 𝐴)
12	11	eqcomd 2735	. . 3 ⊢ (¬ 𝐴 ∈ V → 𝐴 = suc 𝐴)
13		ordeq 6318	. . 3 ⊢ (𝐴 = suc 𝐴 → (Ord 𝐴 ↔ Ord suc 𝐴))
14	12, 13	syl 17	. 2 ⊢ (¬ 𝐴 ∈ V → (Ord 𝐴 ↔ Ord suc 𝐴))
15	10, 14	pm2.61i 182	1 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 206   = wceq 1540   ∈ wcel 2109  Vcvv 3438  Ord word 6310  Oncon0 6311  suc csuc 6313

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-tr 5203  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-ord 6314  df-on 6315  df-suc 6317

This theorem is referenced by: (None)