| 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 6364 | . . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴) | |
| 2 | ordnbtwn 6437 | . . . . . . . 8 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 3 | imnan 403 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
| 4 | 2, 3 | sylibr 236 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 5 | 4 | adantr 484 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
| 6 | ordsuc 7790 | . . . . . . 7 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | ordtri1 6375 | . . . . . . 7 ⊢ ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) | |
| 8 | 6, 7 | sylanb 590 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) |
| 9 | 5, 8 | sylibrd 261 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 10 | 1, 9 | sylan 589 | . . . 4 ⊢ (((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 11 | 10 | exp31 423 | . . 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 208 ∧ wa 399 ∈ wcel 2141 ⊆ wss 3904 Ord word 6341 suc csuc 6344 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-tr 5207 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-ord 6345 df-on 6346 df-suc 6348 |
| This theorem is referenced by: ordelsuc 7796 ordsucelsuc 7798 orduniorsuc 7806 tfindsg2 7838 oaordi 8510 oawordeulem 8518 omeulem2 8547 oeworde 8558 oelimcl 8565 oeeui 8567 nnaordi 8583 nnawordex 8602 oaabs2 8614 omxpenlem 9046 inf3lem5 9584 cantnflt 9624 cantnflem1d 9640 cnfcom 9652 r1ordg 9733 rankr1ag 9757 cfslb2n 10222 cfsmolem 10224 fin23lem26 10279 isf32lem3 10309 ttukeylem7 10469 indpi 10862 nolesgn2ores 27713 nogesgn1ores 27715 nosupbday 27746 nosupres 27748 nosupbnd1lem1 27749 nosupbnd2 27757 noinfbday 27761 noinfres 27763 noinfbnd1lem1 27764 noinfbnd2 27772 fineqvnttrclselem2 35382 onsucss 43807 omabs2 43873 onsucunifi 43911 nadd1suc 43933 |
| Copyright terms: Public domain | W3C validator |