| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordsucss | Structured version Visualization version GIF version | ||
| Description: The successor of an element of an ordinal class is a subset of it. Lemma 1.14 of [Schloeder] p. 2. (Contributed by NM, 21-Jun-1998.) |
| Ref | Expression |
|---|---|
| ordsucss | ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordelord 6339 | . . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴) | |
| 2 | ordnbtwn 6412 | . . . . . . . 8 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 3 | imnan 399 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 4 | 2, 3 | sylibr 234 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 5 | 4 | adantr 480 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 6 | ordsuc 7756 | . . . . . . 7 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | ordtri1 6350 | . . . . . . 7 ⊢ ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) | |
| 8 | 6, 7 | sylanb 581 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) |
| 9 | 5, 8 | sylibrd 259 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 10 | 1, 9 | sylan 580 | . . . 4 ⊢ (((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 11 | 10 | exp31 419 | . . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)))) |
| 12 | 11 | pm2.43b 55 | . 2 ⊢ (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵))) |
| 13 | 12 | pm2.43b 55 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 ⊆ wss 3901 Ord word 6316 suc csuc 6319 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-tr 5206 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-ord 6320 df-on 6321 df-suc 6323 |
| This theorem is referenced by: ordelsuc 7762 ordsucelsuc 7764 orduniorsuc 7772 tfindsg2 7804 oaordi 8473 oawordeulem 8481 omeulem2 8510 oeworde 8521 oelimcl 8528 oeeui 8530 nnaordi 8546 nnawordex 8565 oaabs2 8577 omxpenlem 9006 inf3lem5 9541 cantnflt 9581 cantnflem1d 9597 cnfcom 9609 r1ordg 9690 rankr1ag 9714 cfslb2n 10178 cfsmolem 10180 fin23lem26 10235 isf32lem3 10265 ttukeylem7 10425 indpi 10818 nolesgn2ores 27640 nogesgn1ores 27642 nosupbday 27673 nosupres 27675 nosupbnd1lem1 27676 nosupbnd2 27684 noinfbday 27688 noinfres 27690 noinfbnd1lem1 27691 noinfbnd2 27699 fineqvnttrclselem2 35278 onsucss 43504 omabs2 43570 onsucunifi 43608 nadd1suc 43630 |
| Copyright terms: Public domain | W3C validator |