| 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 6372 | . . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴) | |
| 2 | ordnbtwn 6445 | . . . . . . . 8 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 3 | imnan 404 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 4 | 2, 3 | sylibr 237 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 5 | 4 | adantr 485 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 6 | ordsuc 7798 | . . . . . . 7 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | ordtri1 6383 | . . . . . . 7 ⊢ ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) | |
| 8 | 6, 7 | sylanb 592 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) |
| 9 | 5, 8 | sylibrd 262 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 10 | 1, 9 | sylan 591 | . . . 4 ⊢ (((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 11 | 10 | exp31 424 | . . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)))) |
| 12 | 11 | pm2.43b 56 | . 2 ⊢ (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵))) |
| 13 | 12 | pm2.43b 56 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2145 ⊆ wss 3907 Ord word 6349 suc csuc 6352 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-tr 5213 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-ord 6353 df-on 6354 df-suc 6356 |
| This theorem is referenced by: ordelsuc 7804 ordsucelsuc 7806 orduniorsuc 7814 tfindsg2 7846 oaordi 8519 oawordeulem 8527 omeulem2 8556 oeworde 8567 oelimcl 8574 oeeui 8576 nnaordi 8592 nnawordex 8611 oaabs2 8623 omxpenlem 9054 inf3lem5 9589 cantnflt 9629 cantnflem1d 9645 cnfcom 9657 r1ordg 9738 rankr1ag 9762 cfslb2n 10240 cfsmolem 10242 fin23lem26 10297 isf32lem3 10327 ttukeylem7 10487 indpi 10880 nolesgn2ores 27794 nogesgn1ores 27796 nosupbday 27827 nosupres 27829 nosupbnd1lem1 27830 nosupbnd2 27838 noinfbday 27842 noinfres 27844 noinfbnd1lem1 27845 noinfbnd2 27853 fineqvnttrclselem2 35430 onsucss 43855 omabs2 43921 onsucunifi 43959 nadd1suc 43981 |
| Copyright terms: Public domain | W3C validator |