Theorem sucexeloniOLD 7831

Description: Obsolete version of sucexeloni 7830 as of 6-Jan-2025. (Contributed by BTernaryTau, 30-Nov-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
sucexeloniOLD	⊢ ((𝐴 ∈ On ∧ suc 𝐴 ∈ 𝑉) → suc 𝐴 ∈ On)

Proof of Theorem sucexeloniOLD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		onelss 6425	. . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝑥 ∈ 𝐴 → 𝑥 ⊆ 𝐴))
2		velsn 4641	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
3		eqimss 4041	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → 𝑥 ⊆ 𝐴)
4	2, 3	sylbi 217	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴} → 𝑥 ⊆ 𝐴)
5	4	a1i 11	. . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝑥 ∈ {𝐴} → 𝑥 ⊆ 𝐴))
6	1, 5	orim12d 966	. . . . . . . 8 ⊢ (𝐴 ∈ On → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐴}) → (𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐴)))
7		df-suc 6389	. . . . . . . . . 10 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴})
8	7	eleq2i 2832	. . . . . . . . 9 ⊢ (𝑥 ∈ suc 𝐴 ↔ 𝑥 ∈ (𝐴 ∪ {𝐴}))
9		elun 4152	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐴}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐴}))
10	8, 9	bitr2i 276	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐴}) ↔ 𝑥 ∈ suc 𝐴)
11		oridm 904	. . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐴) ↔ 𝑥 ⊆ 𝐴)
12	6, 10, 11	3imtr3g 295	. . . . . . 7 ⊢ (𝐴 ∈ On → (𝑥 ∈ suc 𝐴 → 𝑥 ⊆ 𝐴))
13		sssucid 6463	. . . . . . 7 ⊢ 𝐴 ⊆ suc 𝐴
14		sstr2 3989	. . . . . . 7 ⊢ (𝑥 ⊆ 𝐴 → (𝐴 ⊆ suc 𝐴 → 𝑥 ⊆ suc 𝐴))
15	12, 13, 14	syl6mpi 67	. . . . . 6 ⊢ (𝐴 ∈ On → (𝑥 ∈ suc 𝐴 → 𝑥 ⊆ suc 𝐴))
16	15	ralrimiv 3144	. . . . 5 ⊢ (𝐴 ∈ On → ∀𝑥 ∈ suc 𝐴𝑥 ⊆ suc 𝐴)
17		dftr3 5264	. . . . 5 ⊢ (Tr suc 𝐴 ↔ ∀𝑥 ∈ suc 𝐴𝑥 ⊆ suc 𝐴)
18	16, 17	sylibr 234	. . . 4 ⊢ (𝐴 ∈ On → Tr suc 𝐴)
19		onss 7806	. . . . . 6 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
20		snssi 4807	. . . . . 6 ⊢ (𝐴 ∈ On → {𝐴} ⊆ On)
21	19, 20	unssd 4191	. . . . 5 ⊢ (𝐴 ∈ On → (𝐴 ∪ {𝐴}) ⊆ On)
22	7, 21	eqsstrid 4021	. . . 4 ⊢ (𝐴 ∈ On → suc 𝐴 ⊆ On)
23		ordon 7798	. . . . 5 ⊢ Ord On
24		trssord 6400	. . . . . 6 ⊢ ((Tr suc 𝐴 ∧ suc 𝐴 ⊆ On ∧ Ord On) → Ord suc 𝐴)
25	24	3exp 1119	. . . . 5 ⊢ (Tr suc 𝐴 → (suc 𝐴 ⊆ On → (Ord On → Ord suc 𝐴)))
26	23, 25	mpii 46	. . . 4 ⊢ (Tr suc 𝐴 → (suc 𝐴 ⊆ On → Ord suc 𝐴))
27	18, 22, 26	sylc 65	. . 3 ⊢ (𝐴 ∈ On → Ord suc 𝐴)
28	27	adantr 480	. 2 ⊢ ((𝐴 ∈ On ∧ suc 𝐴 ∈ 𝑉) → Ord suc 𝐴)
29		elong 6391	. . 3 ⊢ (suc 𝐴 ∈ 𝑉 → (suc 𝐴 ∈ On ↔ Ord suc 𝐴))
30	29	adantl 481	. 2 ⊢ ((𝐴 ∈ On ∧ suc 𝐴 ∈ 𝑉) → (suc 𝐴 ∈ On ↔ Ord suc 𝐴))
31	28, 30	mpbird 257	1 ⊢ ((𝐴 ∈ On ∧ suc 𝐴 ∈ 𝑉) → suc 𝐴 ∈ On)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1539   ∈ wcel 2107  ∀wral 3060   ∪ cun 3948   ⊆ wss 3950  {csn 4625  Tr wtr 5258  Ord word 6382  Oncon0 6383  suc csuc 6385

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-tr 5259  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-ord 6386  df-on 6387  df-suc 6389

This theorem is referenced by: (None)