Theorem ordelord 4484

Description: An element of an ordinal class is ordinal. Proposition 7.6 of [TakeutiZaring] p. 36. (Contributed by NM, 23-Apr-1994.)

Assertion

Ref	Expression
ordelord	⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)

Proof of Theorem ordelord

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2294	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
2	1	anbi2d 464	. . . 4 ⊢ (𝑥 = 𝐵 → ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) ↔ (Ord 𝐴 ∧ 𝐵 ∈ 𝐴)))
3		ordeq 4475	. . . 4 ⊢ (𝑥 = 𝐵 → (Ord 𝑥 ↔ Ord 𝐵))
4	2, 3	imbi12d 234	. . 3 ⊢ (𝑥 = 𝐵 → (((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → Ord 𝑥) ↔ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)))
5		dford3 4470	. . . . . 6 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 Tr 𝑥))
6	5	simprbi 275	. . . . 5 ⊢ (Ord 𝐴 → ∀𝑥 ∈ 𝐴 Tr 𝑥)
7	6	r19.21bi 2621	. . . 4 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → Tr 𝑥)
8		ordelss 4482	. . . 4 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ⊆ 𝐴)
9		simpl 109	. . . 4 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → Ord 𝐴)
10		trssord 4483	. . . 4 ⊢ ((Tr 𝑥 ∧ 𝑥 ⊆ 𝐴 ∧ Ord 𝐴) → Ord 𝑥)
11	7, 8, 9, 10	syl3anc 1274	. . 3 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → Ord 𝑥)
12	4, 11	vtoclg 2865	. 2 ⊢ (𝐵 ∈ 𝐴 → ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵))
13	12	anabsi7 583	1 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2202  ∀wral 2511   ⊆ wss 3201  Tr wtr 4192  Ord word 4465

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-ext 2213

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-in 3207  df-ss 3214  df-uni 3899  df-tr 4193  df-iord 4469

This theorem is referenced by:  tron  4485  ordelon  4486  ordsucg  4606  ordwe  4680  smores  6501