Theorem ordnexbtwnsuc 44530

Description: For any distinct pair of ordinals, if there is no ordinal between the lesser and the greater, the greater is the successor of the lesser. Lemma 1.16 of [Schloeder] p. 2. (Contributed by RP, 16-Jan-2025.)

Assertion

Ref	Expression
ordnexbtwnsuc	⊢ ((𝐴 ∈ 𝐵 ∧ Ord 𝐵) → (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) → 𝐵 = suc 𝐴))

Distinct variable groups:   𝐴,𝑐   𝐵,𝑐

Proof of Theorem ordnexbtwnsuc

Step	Hyp	Ref	Expression
1		ordelord 6410	. . . . . 6 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴)
2		ordnbtwn 6484	. . . . . . . . . 10 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
3	2	pm2.21d 122	. . . . . . . . 9 ⊢ (Ord 𝐴 → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴) → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵)))
4	3	expd 421	. . . . . . . 8 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → (𝐵 ∈ suc 𝐴 → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵))))
5	4	com12 33	. . . . . . 7 ⊢ (𝐴 ∈ 𝐵 → (Ord 𝐴 → (𝐵 ∈ suc 𝐴 → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵))))
6	5	adantl 487	. . . . . 6 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (Ord 𝐴 → (𝐵 ∈ suc 𝐴 → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵))))
7	1, 6	mpd 16	. . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝐵 ∈ suc 𝐴 → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵)))
8		sucidg 6472	. . . . . . 7 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ suc 𝐴)
9	8	adantl 487	. . . . . 6 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ suc 𝐴)
10		ordelon 6412	. . . . . . . 8 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ On)
11		onsuc 7858	. . . . . . . 8 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
12	10, 11	syl 18	. . . . . . 7 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → suc 𝐴 ∈ On)
13		eleq2 2853	. . . . . . . . 9 ⊢ (𝑐 = suc 𝐴 → (𝐴 ∈ 𝑐 ↔ 𝐴 ∈ suc 𝐴))
14		eleq1 2852	. . . . . . . . 9 ⊢ (𝑐 = suc 𝐴 → (𝑐 ∈ 𝐵 ↔ suc 𝐴 ∈ 𝐵))
15	13, 14	anbi12d 644	. . . . . . . 8 ⊢ (𝑐 = suc 𝐴 → ((𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) ↔ (𝐴 ∈ suc 𝐴 ∧ suc 𝐴 ∈ 𝐵)))
16	15	adantl 487	. . . . . . 7 ⊢ (((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) ∧ 𝑐 = suc 𝐴) → ((𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) ↔ (𝐴 ∈ suc 𝐴 ∧ suc 𝐴 ∈ 𝐵)))
17	12, 16	rspcedv 3573	. . . . . 6 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → ((𝐴 ∈ suc 𝐴 ∧ suc 𝐴 ∈ 𝐵) → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵)))
18	9, 17	mpand 708	. . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (suc 𝐴 ∈ 𝐵 → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵)))
19	7, 18	jaod 873	. . . 4 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → ((𝐵 ∈ suc 𝐴 ∨ suc 𝐴 ∈ 𝐵) → ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵)))
20		ralnex 3092	. . . . 5 ⊢ (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) ↔ ¬ ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵))
21	20	biimpi 219	. . . 4 ⊢ (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) → ¬ ∃𝑐 ∈ On (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵))
22	19, 21	nsyli 158	. . 3 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) → ¬ (𝐵 ∈ suc 𝐴 ∨ suc 𝐴 ∈ 𝐵)))
23		ordsuci 7856	. . . . 5 ⊢ (Ord 𝐴 → Ord suc 𝐴)
24	1, 23	syl 18	. . . 4 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord suc 𝐴)
25		ordtri3 6425	. . . 4 ⊢ ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 = suc 𝐴 ↔ ¬ (𝐵 ∈ suc 𝐴 ∨ suc 𝐴 ∈ 𝐵)))
26	24, 25	syldan 603	. . 3 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝐵 = suc 𝐴 ↔ ¬ (𝐵 ∈ suc 𝐴 ∨ suc 𝐴 ∈ 𝐵)))
27	22, 26	sylibrd 262	. 2 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) → 𝐵 = suc 𝐴))
28	27	ancoms 464	1 ⊢ ((𝐴 ∈ 𝐵 ∧ Ord 𝐵) → (∀𝑐 ∈ On ¬ (𝐴 ∈ 𝑐 ∧ 𝑐 ∈ 𝐵) → 𝐵 = suc 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Ord word 6387  Oncon0 6388  suc csuc 6390

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 5255  ax-pr 5398  ax-un 7783

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-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-suc 6394

This theorem is used by:  orddif0suc  44531